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