Skip to main content
SpringerLink
Log in

Games Characterizing Levy-Longo Trees

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

Abstract

We present a simple strongly universal innocent game model for Levy-Longo trees i.e. every point in the model is the denotation of a unique Levy-Longo tree. The observational quotient of the model then gives a universal, and hence fully abstract, model of the pure Lazy Lambda Calculus.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163, 2000.

    Google Scholar 

  2. S. Abramsky and G. McCusker. Games and full abstraction for the Lazy Lambda Calculus. In Proc. LICS, pages 234–243. The Computer Society, 1995.

    Google Scholar 

  3. S. Abramsky and C.-H. L. Ong. Full abstraction in the Lazy Lambda Calculus. Information and Computation, 105:159–267, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Barendregt. The Lambda Calculus. North-Holland, revised edition, 1984.

    Google Scholar 

  5. V. Danos and R. Harmer. The anatomy of innocence. In Proc. CSL 2001, pages 188–202. Springer Verlag, 2001. LNCS Vol. 2142.

    Google Scholar 

  6. P. Di Gianantonio. Game semantics for the Pure Lazy Lambda Calculus. In Proc. TLCA 2001, pages 106–120. Springer-Verlag, 2001.

    Google Scholar 

  7. P. Di Gianantonio, G. Franco, and F. Honsell. Game semantics for the untyped λβη-calculus. In Proc. TLCA 1999, pages 114–128. Springer-Verlag, 1999. LNCS Vol. 1591.

    Google Scholar 

  8. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation, 163:285–408, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. D. Ker, H. Nickau, and C.-H. L. Ong. A universal innocent game model for the Böhm tree lambda theory. In Proc. CSL 1999, pages 405–419. Springer-Verlag, 1999. LNCS Volume 1683.

    Google Scholar 

  10. A. D. Ker, H. Nickau, and C.-H. L. Ong. Innocent game models of untyped λ-calculus. Theoretical Computer Science, 272:247–292, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  11. J.-J. Levy. An algebraic interpretation of equality in some models of the lambda calculus. In C. Böhm, editor, Lambda Calculus and Computer Science Theory, pages 147–165. Springer-Verlag, 1975. LNCS No. 37.

    Chapter  Google Scholar 

  12. G. Longo. Set-theoretical models of lambda calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153–188, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. McCusker. Full abstraction by translation. In Advances in Theory and Formal Methods of Computing. IC Press, 1996.

    Google Scholar 

  14. G. McCusker. Games for recursive types. BCS Distinguished Dissertation. Cambridge University Press, 1998.

    Google Scholar 

  15. G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125–159, 1975.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Universitá de Udine, via delle Scienze, 206, 33100, Udine, Italy

    C. -H. L. Ong & P. Di Gianantonio

  2. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK

    C. -H. L. Ong & P. Di Gianantonio

Authors
  1. C. -H. L. Ong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Di Gianantonio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ong, C.H.L., Di Gianantonio, P. (2002). Games Characterizing Levy-Longo Trees. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation