Extensional models for polymorphism
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Categories, types, and structures: an introduction to category theory for the working computer scientist
New foundations for the geometry of interaction
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Full abstraction for idealized Algol with passive expressions
Theoretical Computer Science - Special issue on linear logic, 1
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Game Semantics for Untyped lambda beta eta-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A modified GoI interpretation for a linear functional programming language and its adequacy
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their co-Kleisli categories. We show that a special linear combinatory algebra of partial involutions, arising from Geometry of Interaction constructions, gives rise to a fully and faithfully complete modelfor ML polymorphic types of system F.