Theoretical Computer Science
Confluent term rewriting systems with membership conditions
1st international workshop on Conditional Term Rewriting Systems
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
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
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence of Terminating Membership Conditional TRS
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Rank 2 Type Systems and Recursive Definitions
Rank 2 Type Systems and Recursive Definitions
Type error slicing in implicitly typed higher-order languages
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Minimality in a Linear Calculus with Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Rewriting Computation and Proof
| Hi-index | 0.00 |
System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of Gödel's System τ. System L owes its power to two features: the use of a closed reduction strategy (which permits the construction of an iterator on an open function, but only iterates the function after it becomes closed), and the use of a liberal typing rule for iterators based on iterative types. In this paper, we study these new types, and show how they relate to intersection types. We also give a sound and complete type reconstruction algorithm for System L.