Rewriting Conversions Implemented with Continuations
- First Online:
- Cite this article as:
- Norrish, M. J Autom Reasoning (2009) 43: 305. doi:10.1007/s10817-009-9146-5
We give a continuation-based implementation of rewriting for systems in the LCF tradition. These systems must construct explicit proofs of equations when rewriting, and currently do so in a way that can be very space-inefficient. An explicit representation of continuations improves performance on large terms, and on long-running computations.