A Fully Complete PER Model for ML Polymorphic Types
Main Authors: | Abramsky, S, Lenisa, M |
---|---|
Format: | Conference item |
Published: |
Springer−Verlag
2000
|
Similar Items
-
Axiomatizing Fully Complete Models for ML Polymorphic Types
by: Abramsky, S, et al.
Published: (2000) -
Fully Complete Minimal PER Models for the Simply Typed λ−calculus
by: Abramsky, S, et al.
Published: (2001) -
Linear realizability and full completeness for typed lambda−calculi
by: Abramsky, S, et al.
Published: (2005) -
Experiments‚ Powerdomains and Fully Abstract Models for Applicative Multiprogramming
by: Abramsky, S
Published: (1983) -
Strictness Analysis and Polymorphic Invariance
by: Abramsky, S
Published: (1986)