A per Model of Polymorphism and Recursive Types
edited by: J. Mitchell
Introduction The ideal model provides an interpretation for a rich type system, with polymorphism and recursion , but not a model of the typed -calculus. In search for a satisfactory semantics for -calculi with recursive and polymorphic types, it seems natural, then, to consider partial equivalence relations (pers) instead of ideals. As ideals are certain subsets of a universal domain D, we replace them with certain pers over D (rather than over !, as in [8, 19]). For example, in order...