Skip to main content
SpringerLink
Log in

May and must convergency in concurrent λ-calculus

  • Contributions
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1994 (MFCS 1994)

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

  • 147 Accesses

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. S. Abramsky, “Domain Theory in Logical Form”, Ann. of Pure and Appl. Logics 51, 1991, 1–77.

    Google Scholar 

  2. F. Alessi, “Type Preorders”, CAAP'94, LNCS 787, 1994, 37–51.

    Google Scholar 

  3. H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, “A Filter Lambda Model and the Completeness of Type Assignment”, J.Symbolic Logic 48, 1983, 931–940.

    Google Scholar 

  4. G. Boudol, “A Lambda Calculus for (Strict) Parallel Functions”, Info. and Comp. 108, 1994, 51–127.

    Google Scholar 

  5. M. Coppo, M. Dezani-Ciancaglini, G. Longo, “Applicative Information Systems”, CAAP '83, LNCS 159, 1983, 35–64.

    Google Scholar 

  6. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, “Filter Models for a Parallel and Non Deterministic λ-calculus”, MFCS '93, LNCS 711, 1993, 403–412.

    Google Scholar 

  7. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, “Fully Abstract Semantics for Concurrent λ-calculus”, TACS'94, LNCS 789, 1994, 16–35.

    Google Scholar 

  8. U. de Liguoro, A. Piperno, “Must Preorder in Non-deterministic Untyped λ-calculus”, CAAP '92, LNCS 582, 1992, 203–220.

    Google Scholar 

  9. C.-H.L. Ong, “Concurrent Lambda Calculus and a General Precongruence Theorem for Applicative Bisimulations”, Draft, Cambridge Un., 1992.

    Google Scholar 

  10. C.-H.L. Ong, “Non-Determinism in a Functional Setting”, LICS '93, IEEE Comp.Soc. Press, Silver Spring, 1993, 275–286.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Udine, Italy

    F. Alessi

  2. Università di Torino, Italy

    M. Dezani-Ciancaglini & U. de'Liguoro

Authors
  1. F. Alessi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dezani-Ciancaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. U. de'Liguoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alessi, F., Dezani-Ciancaglini, M., de'Liguoro, U. (1994). May and must convergency in concurrent λ-calculus. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation