Compilation of combinatory reduction systems

Kahrs, Stefan (1993) Compilation of combinatory reduction systems. In: Heering, Jan and Meinke, Karl and Möller, B. and Nipkow, Tobias, eds. Higher-Order Algebra, Logic, and Term Rewriting. Lecture Notes in Computer Science, 816. Springer pp. 169-188. ISBN 3-540-58233-9. (Full text available)

PDF
Download (242kB)
[img]
Preview
Postscript
Download (194kB)
[img]

Abstract

Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express β-reduction of λ-calculus as a single rewrite rule. The additional expressive power has its price --- CRSs are much harder to implement than ordinary TRSs. We propose an abstract machine suitable for executing CRSs. We define what it means to execute an instruction, and give a translation from CRS rules into sequences of instructions. Applying a rewrite rule to a term is realised by initialising the machine with this term, and then successively executing the instructions of the compiled rule.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: CRS, compilation, abstract machine
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 04 Oct 2009 19:03
Last Modified: 24 Apr 2012 14:12
Resource URI: http://kar.kent.ac.uk/id/eprint/21097 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year