Fully Complete Minimal PER Models for the Simply Typed λ−calculus
Auteurs principaux: | Abramsky, S, Lenisa, M |
---|---|
Format: | Conference item |
Publié: |
2001
|
Documents similaires
-
A Fully Complete PER Model for ML Polymorphic Types
par: Abramsky, S, et autres
Publié: (2000) -
Axiomatizing Fully Complete Models for ML Polymorphic Types
par: Abramsky, S, et autres
Publié: (2000) -
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
par: Naokata Shikuma, et autres
Publié: (2008-09-01) -
The Lazy λ−Calculus
par: Abramsky, S
Publié: (1990) -
Full Abstraction in the Lazy λ−calculus
par: Abramsky, S, et autres
Publié: (1993)