… the Surjective Pairing extensional rule for products … extensional equalities via expansion
rules to the second order typed lambda calculus? The answer is not obvious: for an expansion …

… rewriting system, based on expansion rules, for the extensional second order typed lambda
… This result is an important step towards a new theory of reduction based on expansion rules, …

… To assure the termination of typing, we have to introduce some restriction to the type
system so that recursive extensional types can never µ-expands themselves infinitely in type …

… polymorphic -calculus. This immediately yields a modular proof showing that the second-order
extensional polymorphic -… -expansion with -reduction in the second-order polymorphic -…

… polymorphic A-calculus. We then present a modular proof, showing the second-order
polymorphic A-calculus with a version of ~-expansion is … order extensional A-calculus Afl~3: . ~.~. …

… –5 μ m) resulting from the high extensional strength of the polymeric matrix when foamed at
a … Using polymorphism to induce double-melting behavior and performing the expansion in …

… polymorphic -calculus. We then present a modular proof, showing the second-order polymorphic
-calculus with a version of -expansion … Extensional polymorphism is studied in 5, 9, 10, …

… polymorphic extensional … polymorphic lambda calculus without expansion rules, which we
know is confluent and strongly normalizing, and let S be the system made up of the expansion …

… expansion rules, and then we can give a simple translation of (extensional) Core-ML into
(extensional) … presenting the translation into (extensional) polymorphic lambda calculus, and to …

… system, based on expansion rules, for the extensional second order typed … Expansions and
polymorphism are not modular The … introduced by expansion rules and polymorphic typing. …