Semantics of Typed Lambda-Calculus with Constructors

摘要

We present a Curry-style second-order type system with union and intersectiontypes for the lambda-calculus with constructors of Arbiser, Miquel and Rios, anextension of lambda-calculus with a pattern matching mechanism for variadicconstructors. We then prove the strong normalisation and the absence of matchfailure for a restriction of this system, by adapting the standard reducibilitymethod.