Skip navigation
Skip navigation

Rewriting Conversions Implemented with Continuations

Norrish, Michael


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.

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Journal of Automated Reasoning
DOI: 10.1007/s10817-009-9146-5


File Description SizeFormat Image
01_Norrish_Rewriting_Conversions_2009.pdf221.66 kBAdobe PDF    Request a copy
02_Norrish_Rewriting_Conversions_2009.pdf347.03 kBAdobe PDF    Request a copy
03_Norrish_Rewriting_Conversions_2009.pdf10.49 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator