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 Lamping's style, of other basic computational constructs such as conditionals and recursion.
Supported in part by the ESPRIT Basic Research Project 6454-CONFER.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Aczel. A general church-rosser theorem. Draft, Manchester, 1978.
A. Asperti and C. Laneve. Interaction systems 1: The theory of optimal reductions. Technical report n. 1748, INRIA-Rocquencourt, Septembre 1992.
H.P. Barendregt. The Lambda Calculus. North-Holland, 1985.
A. Burroni. Higher dimensional word problems. In Category Theory and Computer Science, volume 530 of Lecture Notes in Computer Science, pages 94–105. Springer-Verlag, 1991.
J. Field. On laziness and optimality in lambda interpreters: tools for specification and analysis. In Proceedings 17th A CM Symposium on Principles of Programmining Languages, pages 1–15, 1990.
J. Y. Girard. Linear logic. Theoretical Computer Science, 50, 1986.
G. Gonthier, M. Abadi, and J.J. Lévy. The geometry of optimal lambda reduction. In Proceedings 19 th ACM Symposium on Principles of Programmining Languages, page ??, 1992.
G. Gonthier, M. Abadi, and J.J. Lévy. Linear logic without boxes. In Proceedings 7 th Annual Symposium on Logic in Computer Science, page ??, 1992.
V. Kathail. Optimal Interpreters for lambda-calculus based functional languages. PhD thesis, MIT, 1990.
J. W. Klop. Combinatory Reduction System. PhD thesis, Mathematisch Centrum, Amsterdam, 1980.
Y. Lafont. Interaction nets. In Proceedings 17 th ACM Symposium on Principles of Programmining Languages, pages 95–108, 1990.
Y. Lafont. Penrose diagrams and 2-dimensional rewritings. In LMS Symposium on Applications of Categories in Computer Science. Cambridge University Press, 1992.
J. Lamping. An algorithm for optimal lambda calculus reductions. Technical report, Xerox PARC, 1989.
J. Lamping. An algorithm for optimal lambda calculus reductions. In Proceedings 17 th ACM Symposium on Principles of Programmining Languages, pages 16–30, 1990.
C. Laneve. Optimality and Concurrency in Interaction Systems. PhD thesis, Dip. Informatica., Università di Pisa, December 1992.
J.J. Lévy. Réductions correctes et optimales dans le lambda calcul. PhD thesis, Université Paris VII, 1978.
J.J. Lévy. Optimal reductions in the lambda-calculus. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159–191. Academic Press, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asperti, A., Laneve, C. (1993). Optimal reductions in interaction systems. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_84
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive