Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Rewriting Conversions Implemented with Continuations

Date

Authors

Norrish, Michael

Publisher

Kluwer Academic Publishers

Abstract

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.

Keywords

Keywords: Continuation-passing style; Explicit representation; Interactive theorem-proving; Rewriting; Theorem proving Continuation-passing style; Interactive theorem-proving; Rewriting

URI

http://hdl.handle.net/1885/57434

Collections

ANU Research Publications

Source

Journal of Automated Reasoning

Type

Journal article

DOI

10.1007/s10817-009-9146-5

Restricted until

2037-12-31

Downloads

File

Description

01_Norrish_Rewriting_Conversions_2009.pdf (221.66 KB)

02_Norrish_Rewriting_Conversions_2009.pdf (347.03 KB)

03_Norrish_Rewriting_Conversions_2009.pdf (10.49 KB)

abcd