Abstract
The family relation over redexes, introduced by Lèvy [8] for the λ-calculus, essentially generalizes the notion of residual to the case of dynamic creation of new redexes, providing the main theoretical tool for the theory of optimal reductions. In this paper, we investigate the same notion in a powerful supersystem of the λ-calculus, recently introduced by the authors, and called Interaction Systems.
Partially supported by the ESPRIT Basic Research Project 6454 — CONFER.
Preview
Unable to display preview. Download preview PDF.
References
A. Asperti and C. Laneve. Interaction Systems I: the theory of optimal reductions. Technical Report 1748, INRIA-Rocquencourt, September 1992.
A. Asperti and C. Laneve. Optimal Reductions in Interaction Systems. In TapSoft '93, volume 668 of Lecture Notes in Computer Science, pages 485–500. Springer-Verlag, 1993.
A. Asperti and C. Laneve. Paths, Computations and Labels in the λ-calculus. In RTA '93, volume 690 of Lecture Notes in Computer Science, pages 152–167. Springer-Verlag, 1993.
J. W. Klop. Combinatory Reduction System. PhD thesis, Mathematisch Centrum, Amsterdam, 1980.
Y. Lafont. Interaction Nets. In Proceedings 17th ACM Symposium on Principles of Programmining Languages, pages 95–108, 1990.
J. Lamping. An algorithm for optimal lambda calculus reductions. In Proceedings 17th 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, March 1993. Technical Report TD-8/93.
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.
L. Maranget. Optimal Derivations in Weak lambda-calculi and in Orthogonal Terms Rewriting Systems. In Proceedings 17th ACM Symposium on Principles of Programmining Languages, pages 255–269, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asperti, A., Laneve, C. (1994). The family relation in Interaction Systems. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_105
Download citation
DOI: https://doi.org/10.1007/3-540-57887-0_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57887-1
Online ISBN: 978-3-540-48383-0
eBook Packages: Springer Book Archive