Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
The system F of variable types, fifteen years later
Theoretical Computer Science
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
CLEAN: A language for functional graph rewriting
Proc. of a conference on Functional programming languages and computer architecture
A proper extension of ML with an effective type-assignment
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Intersection types for combinatory logic
Theoretical Computer Science
Complete restrictions of the intersection type discipline
Theoretical Computer Science
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)
A calculus for overloaded functions with subtyping
Information and Computation
Intersection type assignment systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Partial Intersection Type Assignment in Applicative Term Rewriting Systems
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Combining First and Higher Order Rewrite Systems with Type Assignment Systems
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
A Meta-Language for Typed Object-Oriented Languages
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Polymorphic Type Schemes and Recursive Definitions
Proceedings of the 6th Colloquium on International Symposium on Programming
Strong Normalization of Typeable Rewrite Systems
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
A Complete Type Inference Algorithm for Simple Intersection Types
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
(Head-) Normalization of Typeable Rewrite Systems
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Sequence Types for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Strict intersection types for the Lambda Calculus
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A notion of type assignment on Curryfied Term Rewriting Systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pair (of basis and type) will be defined in the following sense: from these all admissible pairs can be generated by chains of operations on pairs, consisting of the operations substitution, copying, and weakening. In general, given an arbitrary typeable GTRS, the subject reduction property does not hold. Using the principal type for the left-hand side of a rewrite rule, a sufficient and decidable condition will be formulated that typeable rewrite rules should satisfy in order to obtain this property.