Fully Complete Minimal PER Models for the Simply Typed λ-Calculus-Reference-Cited by-同舟云学术

Fully Complete Minimal PER Models for the Simply Typed λ-Calculus

Published:2001 Issue: Volume: Page:443-457
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Abramsky Samson,Lenisa Marina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44802-0_31

Reference17 articles.

1. S. Abramsky. Retracing some paths in Process Algebra, Concur’96, U. Montanari 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.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unfixing the Fixpoint: The Theories of the λY-Calculus;Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky;2013

2. A game semantics for generic polymorphism;Annals of Pure and Applied Logic;2005-05

3. “Wave-Style” Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models;Lecture Notes in Computer Science;2004

4. Strict Geometry of Interaction Graph Models;Logic for Programming, Artificial Intelligence, and Reasoning;2003

5. A Game Semantics for Generic Polymorphism;Lecture Notes in Computer Science;2003