Evolving games and essential nets for affine polymorphism

Authors:
Andrzej S. Murawski;C.-H. Luke Ong
Affiliations:
Oxford University Computing Laboratory, Oxford, UK;Oxford University Computing Laboratory, Oxford, UK
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 6
Cited 2

Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
Light linear logic

Information and Computation
On full abstraction for PCF: I, II, and III

Information and Computation
Games and Definability for System F

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Dominator Trees and Fast Verification of Proof Nets

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Curry-style type isomorphisms and game semantics

Mathematical Structures in Computer Science
Genericity and the π-calculus

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a game model of Second-order Intuitionistic Multiplicative Affine Logic (IMAL2). We extend Lamarche's essential nets to the second-order affine setting and use them to show that the model is fully and faithfully complete.