Fully complete minimal PER models for the simply typed λ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2142, Issue , 2001, Pages 443-457

  Abramsky, Samson ^a   Lenisa, Marina ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC;

COMBINATORY ALGEBRAS; MINIMAL MODEL; NATURAL NUMBER; REALIZABILITY; SIMPLY TYPED LAMBDA CALCULUS; SUBALGEBRAS;

COMPUTER CIRCUITS;

EID: 23044528606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_31     Document Type: Conference Paper

References (17)

1. S Abramsky. Retracing some paths in Process Algebra, Concur’96, U. Mon-tanari and V. Sassone eds., 1996, 1–17.
2. S Abramsky. Interaction, Combinators, and Complexity, Notes, Siena (Italy), 1997.
3. S Abramsky. Axioms for Definability and Full Completeness, in Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, eds., MIT Press, 2000, 55–75.
4. S Abramsky. A Structural Approach to Reversible Computation, May 2001.
5. S Abramsky, E. Haghverdi, P Scott. Geometry of Interaction and Models of Combinatory Logic, 1998, to appear.
6. S Abramsky, R. Jagadeesan. New foundations for the Geometry of Interaction, Inf. and Comp. 111(1), 1994, 53–119.
7. S Abramsky, R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, J. of Symbolic Logic 59(2), 1994, 543–574.
8. S Abramsky, R Jagadeesan, P Malacaria. Full Abstraction for PCF, Inf. and Comp. 163, 2000, 409–470.
9. S Abramsky, M Lenisa. Fully Complete Models for ML Polymorphic Types, Technical Report ECS-LFCS-99-414, LFCS, 1999 (available at http://www.dimi.uniud.it/˜lenisa/Papers/Soft-copy-ps/lfcs99.ps.gz).
10. S. Abramsky, M Lenisa. A Fully-complete PER Model for ML Polymorphic Types, CSL’00, LNCS 1862, 2000, 140–155.
11. S. Abramsky, J. Longley. Realizability models based on history-free strategies, 1999.
12. J.Y. Girard. Towards a Geometry of Interaction, Contemporary Mathematics 92, 1989, 69–108.
13. A. Ker, H. Nickau, L. Ong. More Universal Game Models of Untyped λ-Calculus: The Bohm Tree Strikes Back, CSL’99, LNCS, 1999.
14. A. Joyal, R. Street, D. Verity. Traced monoidal categories, Math. Proc. Comb. Phil. Soc. 119, 1996, 447–468.
15. J. Laird. Games, control and full abstraction, February 2000.
16. An Algorithm for the Minimal Model, Note, 1997.
17. V. Padovani. Decidability of all Minimal Models, TYPES’95, LNCS 1185, 201–215.