Normalization Results for Typeable Rewrite Systems

Information and Computation

Volumn 133, Issue 2, 1997, Pages 73-116

  Van Bakel, Steffen ^a   Fernández, Maribel ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011111917     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.2617     Document Type: Article

References (36)

1. Abramsky, S. (1990), The lazy Lambda calculus, in "Research Topics in Functional Programming," (D. Turner, Ed.), pp. 65-117, Addison-Wiley, Reading, MA.
2. Ariola, Z., Kennaway, R., Klop, J. W., Sleep, R., and de Vries, F-J. (1994), Syntactic definitions of undefined: On defining the undefined, in "Proceedings of TACS'94. International Symposium on Theoretical Aspects of Computer Software, Sendai, Japan" (M. Hagiya and J. C. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, pp. 543-554, Springer-Verlag, Berlin/New York.
3. van Bakel, S. (1992), Complete restrictions of the intersection type discipline, Theoret. Comput. Sci. 102, 135-163.
4. van Bakel, S. (1993a), Partial intersection type assignment in application term rewriting systems, in "Proceedings of TLCA'93. International Conference on Typed Lambda Calculi and Applications, Utrecht the Netherlands" (M. Bezem and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 884, pp. 29-44, Springer-Verlag, Berlin/New York.
5. van Bakel, S. (1993b), Principal type schemes for the strict type assignment system, Logic and Comput. 3(6), 643-670.
6. van Bakel, S. (1995), Intersection type assignment systems, Theoret. Comput. Sci. 151(2), 385-435.
7. van Bakel, S. (1996), Rank 2 intersection type assignment in term rewriting systems, Fund. Informat. 26(2), 141-166.
8. van Bakel, S., and Fernández, M. (1994), Strong normalization of typeable rewrite systems, in "Proceedings of HOA'93. First International Workshop on Higher Order Algebra, Logic and Term Rewriting, Amsterdam, the Netherlands, Selected Papers" (J. Heering, K. Meinke, B. Mõller, and T. Nipkow, Eds.), Lecture Notes in Computer Science, Vol. 816, pp. 20-39, Springer-Verlag, Berlin/ New York.
9. van Bakel, S., and Fernández, M. (1995), (Head-)normalization of typeable rewrite systems, in "Proceedings of RTA'95. 6th International Conference on Rewriting Techniques and Applications, Kaiserslautern, Germany" (J. Hsiang, Ed.), Lecture Notes in Computer Science, Vol. 914, pp. 279-293, Springer-Verlag, Berlin/New York.
10. van Bakel, S., Smetsers, S., and Brock, S. (1992), Partial type assignment in left linear applicative term rewriting system, in "Proceedings of CAAP'92. 17th Colloquium on Trees in Algebra and Programming, Rennes, France" (J.-C. Raoult, Ed.), Lecture Notes in Computer Science, Vol. 581, pp. 300-321, Springer-Verlag, Berlin/New York.
11. Barbanera, F., and Fernández, M. (1993), Combining first and higher order rewrite systems with type assignment systems, in, "Proceedings of TCLA'93. International Conference on Typed Lambda Calculi and Applications, Utrecht, the Netherlands" (M. Bezem, and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 664, pp. 60-74, Springer-Verlag, Berlin/New York.
12. Barbanera, F., Fernández, M., and Geuvers, H. (1994), 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.
13. Barendregt, H. (1984), "The Lambda Calculus: Its Syntax and Semantics," rev. ed., North-Holland, Amsterdam.
14. Barendregt, H., Coppo, M., and Dezani-Ciancaglini, M. (1983), A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48(4), 931-940.
15. Barendregt, H. P., van Eekelen, M. C. J. D., Glauert, J. R. W., Kennaway, J. R., Plasmeijer, M. J., and Sleep, M. R. (1987), Term graph rewriting, in "Proceedings of PARLE, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands," Lecture Notes in Computer Science, Vol. 259-II, pp. 141-158, Springer-Verlag, Berlin/New York.
16. Barendsen, E., and Smetsers, S. (1993), Conventional and Uniqueness Typing in Graph Rewrite Systems, in "Proceedings of FST&TCS'93. 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India" (R. K. Shyamasunda, Ed.), Lecture Notes in Computer Science, Vol. 761, pp. 41-52, Springer-Verlag, Berlin/New York.
17. Brus, T., van Eekelen, M. C. J. D., van Leer, M. O., and Plasmeijer, M. J. (1987), Clean - A language for functional graph rewriting, in "Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland," Lecture Notes in Computer Science, Vol. 274, pp. 364-368, Springer-Verlag, Berlin/New York.
18. Coppo, M., and Dezani-Ciancaglini, M. (1980), An extension of the basic functionality theory for the λ-calculus, Notre Dame J. Formal Logic 21(4), 685-693.
19. Coppo, M., Dezani-Ciancaglini, M., and Venneri, B. (1980), Principal type schemes and λ-calculus semantics, in "To H.B. Curry, Essays in Combinatory Logic, Lambda-Calculus and Formalism" (J. R. Hindley and J. P. Seldin, Eds.), pp. 535-560, Academic Press, New York.
20. Curry, H. B., and Feys, R. (1958), "Combinatory Logic," Vol. 1, North-Holland, Amsterdam.
21. Dershowitz, N., and Jouannaud, J. P. (1990), Rewrite systems, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, Chap. 6, pp. 245-320, North-Holland, Amsterdam.
22. Dezani-Ciancaglini, M., and Hindley, J. R. (1992), Intersection types for combinatory logic, Theoret. Comput. Sci. 100, 303-324.
23. Fernández, M., and Jouannaud, J. P. (1994), Modular termination of term rewriting systems revisited, in "Recent Trends in Data Type Specification. 10th Workshop on Specification of Abstract Data Types, S. Margherita, Italy" (E. Astesiano and A. Tarlecki, Eds.), Lecture Notes in Computer Science, Vol. 906, pp. 255-272, Springer-Verlag, Berlin/New York.
24. Futatsugi, K., Goguen, J., Jouannaud, J. P., and Meseguer, J. (1985), Principles of OBJ2, in "Proceedings 12th ACM Symposium on Principles of Programming Languages," pp. 52-66.
25. Girard, J.-Y., Lafont, Y., and Taylor, P. (1989), "Proofs and Types," Cambridge Tracts in Theoretical Computer Science, Cambridge Univ. Press, Cambridge, UK.
26. Hindley, J. R. (1969). The principal type scheme of an object in combinatory logic, Trans. Amer. Math. Soc. 146, 29-60.
27. Jouannaud, J. P., and Okada, M. (1991), Executable higher-order algebraic specification languages, in "Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science," pp. 350-361.
28. Kahrs, S. (1996), Confluence of curried term-rewriting systems, J. Symbolic Comput. 19(6), 601-623.
29. Kennaway, R., Klop, J. M., Sleep, R., and de Vries F. J. (1996), Comparing curried and uncurried rewriting, J. Symbolic Comput., to appear.
30. Klop, J. W. (1987), Term rewriting systems: A tutorial, EATCS Bul. 32, 143-182.
31. Klop, J. W. (1992), Term rewriting systems, in "Handbook of Logic in Computer Science" (S. Abramsky, Dov. M. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 2, Chap. 1, pp. 1-116, Clarendon Press, Oxford.
32. Milner, R. (1978), A theory of type polymorphism in programming, J. Comput. System Sci. 17, 348-375.
33. Pfenning, F. (1988), Partial polymorphic type inference and higher-order unification, in "Proceedings of the 1988 ACM conference on LISP and Functional Programming Languages," pp. 153-163.
34. Pierce, B. C. (1991), "Programming with Intersection Types and Bounded Polymorphism," Ph.D. thesis CMU-CS-91-205, Carnegie Mellon University, School of Computer Science, Pittsburgh.
35. Tait, W. W. (1967), Intensional interpretation of functionals of finite type I, J. Symbolic Logic 32(2), 198-223.
36. Turner, D. A. (1985), Miranda: A non-strict functional language with polymorphic types, in "Proceedings of the Conference on Functional Programming Languages and Computer Architecture," Lecture Notes in Computer Science, Vol. 201, pp. 1-16, Springer-Verlag, Berlin/New York.