Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations--everything has to fit in one word, if necessary by being heap-...
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...