Partial intersection type assignment in applicative term rewriting systems-Reference-Cited by-同舟云学术

Partial intersection type assignment in applicative term rewriting systems

Published:1993 Issue: Volume: Page:29-44
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

van Bakel Steffen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0037096

Reference22 articles.

1. S. van Bakel. Principal type schemes for the Strict Type Assignment System. Technical Report 91-6, Department of Computer Science, University of Nijmegen, 1991.

2. S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135–163, 1992.

3. S. van Bakel. Partial Intersection Type Assignment of Rank 2 in Applicative Term Rewriting Systems. Technical Report 92-03, Department of Computer Science, University of Nijmegen, 1992.

4. S. van Bakel, S. Smetsers, and S. Brock. Partial Type Assignment in Left Linear Applicative Term Rewriting Systems. In J.-C. Raoult, editor, Proceedings of CAAP '92. 17th Colloquim on Trees in Algebra and Programming, Rennes, France, volume 581 of Lecture Notes in Computer Science, pages 300–321. Springer-Verlag, 1992.

5. H. Barendregt. The lambda calculus: its syntax and semantics. North-Holland, Amsterdam, revised edition, 1984.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Principality and type inference for intersection types using expansion variables;Theoretical Computer Science;2004-01

2. Strictness, totality, and non-standard-type inference;Theoretical Computer Science;2002-02

3. Normalization Results for Typeable Rewrite Systems;Information and Computation;1997-03

4. (Head-)normalization of typeable rewrite systems;Rewriting Techniques and Applications;1995

5. Strong normalization of typeable rewrite systems;Higher-Order Algebra, Logic, and Term Rewriting;1994