Skip to main content
SpringerLink
Log in

The family relation in Interaction Systems

  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 789))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Asperti and C. Laneve. Interaction Systems I: the theory of optimal reductions. Technical Report 1748, INRIA-Rocquencourt, September 1992.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  4. J. W. Klop. Combinatory Reduction System. PhD thesis, Mathematisch Centrum, Amsterdam, 1980.

    Google Scholar 

  5. Y. Lafont. Interaction Nets. In Proceedings 17th ACM Symposium on Principles of Programmining Languages, pages 95–108, 1990.

    Google Scholar 

  6. J. Lamping. An algorithm for optimal lambda calculus reductions. In Proceedings 17th ACM Symposium on Principles of Programmining Languages, pages 16–30, 1990.

    Google Scholar 

  7. C. Laneve. Optimality and Concurrency in Interaction Systems. PhD thesis, Dip. Informatica, Università di Pisa, March 1993. Technical Report TD-8/93.

    Google Scholar 

  8. J.J. Lévy. Réductions correctes et optimales dans le lambda calcul. PhD thesis, Université Paris VII, 1978.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Matematica, P.za di Porta S. Donato, 5, 40127, Bologna, Italy

    Andrea Asperti

  2. INRIA Sophia Antipolis, 2004 Route des Lucioles, BP 93, 06902, Valbonne, France

    Cosimo Laneve

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cosimo Laneve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Hagiya John C. Mitchell

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation