A Fully Complete PER Model for ML Polymorphic Types

Lignende værker

• Axiomatizing Fully Complete Models for ML Polymorphic Types
  af: Abramsky, S, et al.
  Udgivet: (2000)
• Fully Complete Minimal PER Models for the Simply Typed λ−calculus
  af: Abramsky, S, et al.
  Udgivet: (2001)
• Linear realizability and full completeness for typed lambda−calculi
  af: Abramsky, S, et al.
  Udgivet: (2005)
• Experiments‚ Powerdomains and Fully Abstract Models for Applicative Multiprogramming
  af: Abramsky, S
  Udgivet: (1983)
• A fully abstract denotational semantics for the calculus of higher−order communicating systems
  af: Thomsen, B, et al.
  Udgivet: (2001)