Skip to main content
Conference ProceedingsOPEN ACCESS

Optimal reductions in interaction systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 668 LNCS 485-500
DOI: 10.1007/3-540-56610-4_84
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Lamping’s optimal graph reduction technique for the λ-calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. This provides a uniform description, in Lamlfing’s style, of other basic computational constructs such as conditionals and recursion.

Cite

CITATION STYLE

APA

Asperti, A., & Laneve, C. (1993). Optimal reductions in interaction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 668 LNCS, pp. 485–500). Springer Verlag. https://doi.org/10.1007/3-540-56610-4_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free