Fully Complete Minimal PER Models for the Simply Typed λ−calculus
Główni autorzy: | Abramsky, S, Lenisa, M |
---|---|
Format: | Conference item |
Wydane: |
2001
|
Podobne zapisy
-
A Fully Complete PER Model for ML Polymorphic Types
od: Abramsky, S, i wsp.
Wydane: (2000) -
Axiomatizing Fully Complete Models for ML Polymorphic Types
od: Abramsky, S, i wsp.
Wydane: (2000) -
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
od: Naokata Shikuma, i wsp.
Wydane: (2008-09-01) -
The Lazy λ−Calculus
od: Abramsky, S
Wydane: (1990) -
Full Abstraction in the Lazy λ−calculus
od: Abramsky, S, i wsp.
Wydane: (1993)