Final Semantics for untyped lambda-calculus

Proof principles for reasoning about various semantics of untyped λ-calculus are discussed. The semantics are determined operationally by fixing a particular reduction strategy on λ-terms and a suitable set of values, and by taking the corresponding observational equivalence on terms. These principles arise naturally as co-induction principles, when the observational equivalences are shown to be induced by the unique mapping into a final F-coalgebra, for a suitable functor F. This is achieved either by induction on computation steps or exploiting the properties of some, computationally adequate, inverse limit denotational model. The final F-coalgebras cannot be given, in general, the structure of a “denotational” λ-model. Nevertheless the “final semantics” can count as compositional in that it induces a congruence. We utilize the intuitive categorical setting of hypersets and functions. The importance of the principles introduced in this paper lies in the fact that they often allow to factorize the complexity of proofs (of observational equivalence) by “straight” induction on computation steps, which are usually lengthy and error-prone.

[1]  Marcelo P. Fiore,et al.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[3]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[4]  C.-H. Luke Ong,et al.  Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

[5]  Furio Honsell,et al.  Processes and Hyperuniverses , 1994, MFCS.

[6]  C.-H. Luke Ong.  The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .

[7]  Jan J. M. M. Rutten.  Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..

[8]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[9]  Furio Honsell,et al.  Some Results on the Full Abstraction Problem for Restricted Lambda Calculi , 1993, MFCS.

[10]  Mariangiola Dezani-Ciancaglini,et al.  Type Theories, Normal Forms and D_\infty-Lambda-Models , 1987, Inf. Comput..

[11]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[12]  M. Coppo.  Type theories, normal forms, and D?-lambda-models*1 , 1987 .

[13]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  Andrew M. Pitts,et al.  Relational properties of recursively defined domains , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[15]  Furio Honsell,et al.  An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus , 1992, J. Comput. Syst. Sci..

[16]  Furio Honsell,et al.  Operational, denotational and logical descriptions: a case study , 1992, Fundam. Informaticae.

[17]  F. Honsell,et al.  Set theory with free construction principles , 1983 .

[18]  Jan J. M. M. Rutten,et al.  On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.