Rewriting Conversions Implemented with Continuations

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 la...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of automated reasoning 2009-10, Vol.43 (3), p.305-336
1. Verfasser:	Norrish, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	Artificial Intelligence Automated reasoning Computation Computer Science Construction Conversion Low cycle fatigue Mathematical analysis Mathematical Logic and Formal Languages Mathematical Logic and Foundations Performance enhancement Representations Symbolic and Algebraic Manipulation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!