Rank 2 intersection type assignment in term rewriting systems

Fundamenta Informaticae

Volumn 26, Issue 2, 1996, Pages 141-166

  Van Bakel, Steffen ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES;

CURRYFIED TERM REWRITING SYSTEMS; RANK 2 INTERSECTION TYPE ASSIGNMENT; SUBJECT REDUCTION PROPERTY;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0030144653     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-26204     Document Type: Article

References (37)

1. S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135-163, 1992.
2. S. van Bakel. Partial Intersection Type Assignment in Applicative Term Rewriting Systems. In M. Bezem and J.F. Groote, editors, Proceedings of TLCA '93. International Conference on Typed Lambda Calculi and Applications, Utrecht, the Netherlands, volume 664 of Lecture Notes in Computer Science, pages 29-44. Springer-Verlag, 1993.
3. S. van Bakel. Intersection Type Assignment Systems. Theoretical Computer Science, 151, 1995. To appear.
4. S. van Bakel and M. Fernández. Strong Normalization of Typeable Rewrite Systems. In Jan Heering, Karl Meinke, Bernhard Möller, and Tobias Nipkow, editors, Proceedings of HOA '93. First International Workshop on Higher Order Algebra, Logic and Term Rewriting, Amsterdam, the Netherlands. Selected Papers, volume 816 of Lecture Notes in Computer Science, pages 20-39. Springer-Verlag, 1994.
5. S. van Bakel and M. Fernández. (Head-)Normalization of Typeable Rewrite Systems. In Jieh Hsiang, editor, Proceedings of RTA '95. 6th International Conference on Rewriting Techniques and Applications, Kaiserslautern, Germany, volume 914 of Lecture Notes in Computer Science, pages 279-293. Springer-Verlag, 1995.
6. 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.
7. F. Barbanera and M. Fernández. Combining first and higher order rewrite systems with type assignment systems. In M. Bezem and J.F. Groote, editors, Proceedings of TLCA '93. International Conference on Typed Lambda Calculi and Applications, Utrecht, the Netherlands, volume 664 of Lecture Notes in Computer Science, pages 60-74. Springer-Verlag, 1993.
8. th International Colloquium on Automata, Languages and Programming, Lund, Sweden, volume 700 of Lecture Notes in Computer Science, pages 657-668. Springer-Verlag, 1993.
9. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of Strong Normalization and Confluence in the λ-algebraic-cube. In Proceedings of the ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, 1994.
10. H. Barendregt. The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition, 1984.
11. H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48(4):931-940, 1983.
12. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In Proceedings of PARLE, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, volume 259-II of Lecture Notes in Computer Science, pages 141-158. Springer-Verlag, 1987.
13. T. Brus, M.C.J.D. van Eekelen, M.O. van Leer, and M.J. Plasmeijer. Clean - A Language for Functional Graph Rewriting. In Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, volume 274 of Lecture Notes in Computer Science, pages 364-368. Springer-Verlag, 1987.
14. th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India, volume 761 of Lecture Notes in Computer Science, pages 52,71. Springer-Verlag, 1993.
15. G. Castagna, G. Ghelli, and G. Longo. A Calculus for Overloaded Functions with Subtyping. Information and Computation, 117(1):115-135, 1995.
16. M. Coppo and M. Dezani-Ciancaglini. An Extension of the Basic Functionality Theory for the λ-Calculus. Notre Dame Journal of Formal Logic, 21(4):685-693, 1980.
17. M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 27:45-58, 1981.
18. M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. 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 102-123. Springer-Verlag, 1992.
19. H.B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1958.
20. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 245-320. North-Holland, 1990.
21. M. Dezani-Ciancaglini and J.R. Hindley. Intersection types for combinatory logic. Theoretical Computer Science, 100:303-324, 1992.
22. th ACM Symposium on Principles of Programming Languages, pages 52-66, 1985.
23. J.Y. Girard. The System F of Variable Types, Fifteen years later. Theoretical Computer Science, 45:159-192, 1986.
24. J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, 1969.
25. A.J. Kfoury and J. Tiuryn. Type reconstruction in finite-rank fragments of the second-order λ-calculus. Information and Computation, 98(2):228-257, 1992.
26. A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. A proper extension of ML with an effective type-assignment. In Proceedings of the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Diego, California, pages 58-69, 1988.
27. J.W. Klop. Term Rewriting Systems: a tutorial. EATCS Bulletin, 32:143-182, 1987.
28. J.W. Klop. Term Rewriting Systems. In S. Abramsky, Dov.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1-116. Clarendon Press, 1992.
29. th ACM Symposium on Principles of Programming Languages, Austin Texas, pages 88-98, 1983.
30. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
31. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proceedings of the International Symposium on Programming, Toulouse, France, volume 167 of Lecture Notes Computer Science, pages 217-239. Springer-Verlag, 1984.
32. E.G.J.M.H. Nöcker, J.E.W. Smetsers, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Concurrent Clean. In Proceedings of PARLE '91, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, volume 506-II of Lecture Notes in Computer Science, pages 202-219. Springer-Verlag, 1991.
33. V. van Oostrom. Lambda Calculus with Patterns. Technical Report IR-228, Faculteit der Wiskunde en Informatica, Vrije Universiteit Amsterdam, 1990.
34. S. Peyton Jones. The Implementation of Functional Programming Languages. Series in Computer Science. Prentice/Hall International, Englewood Cliffs, NJ, USA, 1987.
35. J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
36. S. Ronchi della Rocca and B. Venneri. Principal type schemes for an extended type theory. Theoretical Computer Science, 28:151-169, 1984.
37. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceedings of the conference on Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 1985.