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)