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