The system F of variable types, fifteen years later
Theoretical Computer Science
Proofs and types
Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Handbook of theoretical computer science (vol. B)
Filter models with polymorphic types
Theoretical Computer Science
Complete restrictions of the intersection type discipline
Theoretical Computer Science
Adding algebraic rewriting to the untyped lambda calculus
Information and Computation
Type reconstruction in finite rank fragments of the second-order &lgr;-calculus
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Handbook of logic in computer science (vol. 2)
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Embedding a second-order type system into an intersection type system
Information and Computation
Intersection type assignment systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rank 2 intersection type assignment in term rewriting
Fundamenta Informaticae
Intersection type assignment systems with higher-order algebraic rewriting
Theoretical Computer Science
Normalization results for typeable rewrite systems
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
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Modular Termination of Term Rewriting Systems Revisited
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Some Computational Properties of Intersection Types
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
Expansion for universal quantifiers
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
We define two type assignment systems for first-order rewriting extended with application, λ-abstraction, and β-reduction, using a combination of (Ω-free) intersection types and second-order polymorphic types. The first system is the general one, for which we prove subject reduction, and strong normalisation of typeable terms. The second is a decidable subsystem of the first, by restricting to Rank 2 (intersection and quantified) types. For this system we define, using an extended notion of unification, a notion of principal typing which is more general than ML's principal type property, since also the types for the free variables of terms are inferred.