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

Схожие документы

• A Fully Complete PER Model for ML Polymorphic Types
  по: Abramsky, S, и др.
  Опубликовано: (2000)
• Axiomatizing Fully Complete Models for ML Polymorphic Types
  по: Abramsky, S, и др.
  Опубликовано: (2000)
• Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
  по: Naokata Shikuma, и др.
  Опубликовано: (2008-09-01)
• The Lazy λ−Calculus
  по: Abramsky, S
  Опубликовано: (1990)
• Full Abstraction in the Lazy λ−calculus
  по: Abramsky, S, и др.
  Опубликовано: (1993)