Abstract
Coinductive characterizations of various observational congruences which arise in the semantics of λ-calculus, when λ-terms are evaluated according to various reduction strategies, are discussed. We analyze and extend to non-lazy strategies, both deterministic and non-deterministic, Howe's congruence candidate method for proving the coincidence of the applicative (bisimulation) and the contextual equivalences. This purely syntactical method is based itself on a coinductive argument.
Work supported by HCM Contract No. CHRX-CT92.0046 Lambda Calcul Typé,
Chapter PDF
References
S.Abramsky, L.Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, 105(2):159–267, 1993.
H.Barendregt, The Lambda Calculus, its Syntax and Semantics, North Holland, Amsterdam, 1984.
L.Egidi, F.Honsell, S.Ronchi Della Rocca, Operational, denotational and logical Descriptions: a Case Study, Fundamenta Informaticae, 16(2):149–169, 1992.
F.Honsell, M.Lenisa, Final Semantics for untyped λ-calculus, M.Dezani et al. eds, TLCA'95 Springer LNCS, 902:249–265, Edinburgh, 1995.
F.Honsell, S.Ronchi Della Rocca, An approximation theorem for topological lambda models ..., J. of Computer and System Sciences, 45(l):49–75, 1992.
D.Howe, Equality in Lazy Computation Systems, 4th LICS Conference Proceedings, IEEE Computer Society Press, 198–203, 1989.
D.Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, 124(2):103–112, 1996.
M.Lenisa, Final Semantics for a Higher Order Concurrent Language, CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS, 1059:102–118, 1996.
M.Lenisa, Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for λ-calculi, to appear in TLCA'97 Proc.
I.Mason, S.Smith, C.Talcott, From Operational Semantics to Domain Theory, Information and Computation to appear.
P.Pérez, An extensional partial combinatory algebra based on λ-terms, MFCS'91 Conference Proceedings, Springer LNCS, 520, 1996.
A.M.Pitts, Relational Properties of Domains, Inf. and Comp., 127:66–90, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenisa, M. (1997). A uniform syntactical method for proving coinduction principles in λ-calculi. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030606
Download citation
DOI: https://doi.org/10.1007/BFb0030606
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive