Fully Complete Minimal PER Models for the Simply Typed λ−calculus

Podobne knjige/članki

• A Fully Complete PER Model for ML Polymorphic Types
  od: Abramsky, S, et al.
  Izdano: (2000)
• Axiomatizing Fully Complete Models for ML Polymorphic Types
  od: Abramsky, S, et al.
  Izdano: (2000)
• Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
  od: Naokata Shikuma, et al.
  Izdano: (2008-09-01)
• The Lazy λ−Calculus
  od: Abramsky, S
  Izdano: (1990)
• Full Abstraction in the Lazy λ−calculus
  od: Abramsky, S, et al.
  Izdano: (1993)