Some Results on the Full Abstraction Problem for Restricted Lambda Calculi (1993)

Cached

Download Links

by Furio Honsell , Marina Lenisa , Dedicated To Corrado Bohm
Venue:In Proc. of the 18 th International Symposium on Mathematical Foundations of Computer Science, MFCS'93, Springer LNCS
Citations:14 - 1 self

Documents Related by Co-Citation

1115 The Lambda Calculus: Its Syntax and Semantics – H Barendregt - 1984
133 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
245 Combinatory reduction systems – J W Klop - 1980
70 Some Properties of Conversion – A Church, J B Rosser - 1936
13 Strong normalization and perpetual reductions in the lambda calculus – J A Bergstra, J W Klop - 1982
228 Domain Theory in Logical Form – Samson Abramsky - 1991
40 Set-Theoretical and Other Elementary Models of the lambda-calculus – Gordon Plotkin - 1993
316 A Compendium of Continuous Lattices – G Gierz, K H Hofmann, K Keimel, J D Lawson, M Mislove, D S Scott - 1980
518 Lambda Calculi with Types – Henk Barendregt, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, H. P. Barendregt - 1992
40 Set-Theoretical models of lambda calculus: Theories – P Longo
320 The Calculi of Lambda Conversion – A Church - 1941
26 Type Theories, Normal Forms and D1-Lambda-Models. Information and Computation 72 – M COPPO, M DEZANI-CIANCAGLINI, M ZACCHI - 1987
216 A filter lambda model and the completeness of type assignment. J.Symbolic Logic, 48:931--940 – H Barendregt, M Coppo, M Dezani-Ciancaglini - 1983
103 Complete restrictions of the intersection type discipline – Steffen Van Bakel - 1992
20 On Higher Order Recursive Program Schemes – Zurab Khasidashvili
24 Termination and Confluence Properties of Structured Rewrite Systems – Bernhard Gramlich - 1996
19 Surjective Pairing and Strong Normalization: Two Themes – R C de Vrijer - 1987
32 The Conservation Theorem revisited – Philippe de Groote - 1993
565 Term Rewriting Systems – J. W. Klop - 1992