Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
Proofs and types
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
The Definition of Standard ML
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
The λ-calculus with constructors: Syntax, confluence and separation
Journal of Functional Programming
On the stability by union of reducibility candidates
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic constructors. To prove the strong normalisation property for this system, we translate well-typed terms in an auxiliary calculus of case-normal forms using the interpretation method. We finally prove the strong normalisation property for the auxiliary calculus using the standard reducibility method.