LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Complete restrictions of the intersection type discipline
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Functions over free algebras definable in the simply typed lambda calculus
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A calculus for overloaded functions with subtyping
Information and Computation
Principality and decidable type inference for finite-rank intersection types
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
Une Extension de la Theorie des Types en lambda-Calcul
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The simple semantics for Coppe-Dezani-Sallé types
Proceedings of the 5th Colloquium on International Symposium on Programming
Normalization of Typable Terms by Superdevelopments
Proceedings of the 12th International Workshop on Computer Science Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Some Computational Properties of Intersection Types
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
This paper presents a novel method for comparing computational properties of λ-terms that are typeable with intersection types, with respect to terms that are typeable with Curry types. We introduce a translation from intersection typing derivations to Curry typeable terms that is preserved by β-reduction: this allows the simulation of a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach proves strong normalisation for the intersection system naturally by means of purely syntactical techniques. The paper extends the results presented in Bucciarelli et al. (1999) to the whole intersection type system of Barendregt, Coppo and Dezani, thus providing a complete proof of the conjecture, proposed in Leivant (1990), that all functions uniformly definable using intersection types are already definable using Curry types.