search

Paradoxika / Skeptik

A library for Proof Theory (especially Proof Compression) in Scala.
33 stars 25 forks source link

Optimize algorithms by directly constructing a Proof #51

Open ceilican opened 11 years ago

ceilican commented 11 years ago

For some algorithms (e.g. "DAGify"), it might be possible and not too hard to directly construct a Proof during the foldDown or bottomUp traversal, instead of calling the Proof constructor when the traversal is finished. The Proof constructor traverses the proof once again, and this extra traversal might be saved.

ceilican commented 11 years ago

Unless efficiency becomes an issue, though, I think this issue should be regarded as low priority.