Fully Complete Minimal PER Models for the Simply Typed λ−calculus
Egile Nagusiak: | Abramsky, S, Lenisa, M |
---|---|
Formatua: | Conference item |
Argitaratua: |
2001
|
Antzeko izenburuak
-
A Fully Complete PER Model for ML Polymorphic Types
nork: Abramsky, S, et al.
Argitaratua: (2000) -
Axiomatizing Fully Complete Models for ML Polymorphic Types
nork: Abramsky, S, et al.
Argitaratua: (2000) -
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
nork: Naokata Shikuma, et al.
Argitaratua: (2008-09-01) -
The Lazy λ−Calculus
nork: Abramsky, S
Argitaratua: (1990) -
Full Abstraction in the Lazy λ−calculus
nork: Abramsky, S, et al.
Argitaratua: (1993)