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