Termination of algebraic type systems: The syntactic approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1298, Issue , 1997, Pages 174-193

  Baxthe, Gilles ^a   Van Raamsdonk, Femke ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957619613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027010     Document Type: Conference Paper

References (25)

1. 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, volume 664 of Lecture Notes in Computer Science, pages 60-74. Springer-Verlag, 1993.
2. F. Barbanera and M. Fernández. Modularity of termination and confluence in combinations of rewrite systems with X., In A. Lingas, E. Karlsson, and S. Karls-son, editors, Proceedings of ICALP'93, volume 700 of Lecture Notes in Computer Science, pages 657-668. Springer-Verlag, 1993.
3. F. Barbanera and M. Fernández. Intersection type assignment systems with higher-order algebraic rewriting. Theoretical Computer Science, 170(l-2):173-207, 15 December 1996.
4. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of strong normalisation and confluence in the algebraic λ-cube. In Proceedings of LICS'94, pages 406-415. IEEE Computer Society Press, 1994.
5. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, pages 117-309. Oxford Science Publications, 1992. Volume 2.
6. G. Barthe and H. Geuvers. Congruence types. In H. Kleine Buening, editor, Proceedings of GSL '95, volume 1092 of Lecture Notes in Computer Science, pages 36-51. Springer-Verlag, 1996.
7. G. Barthe and H. Geuvers. Modular properties of algebraic type systems. In G. Dowek, J. Heering, K. Meinke, and B. Möller, editors, Proceedings of HOA '95, volume 1074 of Lecture Notes in Computer Science, pages 37-56. Springer-Verlag, 1996.
8. G. Barthe, J. Hatcliff, and M.H. Sørensen. Weak Normalization implies Strong Normalization in Generalized Non-Dependent Pure Type Systems. Draft, 1997.
9. G. Barthe and P.-A. Melliès. On the subject reduction property for algebraic type systems. Proceedings of CSL'96. To appear as LNCS, 1996.
10. G. Barthe, M. Ruys, and H. Barendregt. A two-level approach towards lean proof-checking. In S. Berardi and M. Coppo, editors, Proceedings of TYPES'95, volume 1158 of Lecture Notes in Computer Science, pages 16-35. Springer-Verlag, 1996.
11. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of LIGS '88, pages 82-90. IEEE Computer Society Press, 1988.
12. V. Breazu-Tannen and J. Gallier, Polymorphic rewriting conserves algebraic strong normalisation. Theoretical Computer Science, 83:3-28, 1990.
13. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95-120, February/March 1988.
14. E. Di Cosmo. A brief history of rewriting with extensionality. In F. Kamared-dine, editor, International Summer School on Type Theory and Term Rewriting, Glasgow, September 1996. Kluwer, 199x. To appear.
15. R. Di Cosmo and D. Kesner. Combining algebraic rewriting, extensional lambda calculi, and fixpoints. Theoretical Computer Science, 169(2):201-220, 5 December 1996.
16. D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101:251-267, 1992.
17. M. Fernandez. Modèles de calcul multiparadigmes fondés sur la réécriture. PhD thesis, Université Paris-Sud Orsay, 1993.
18. H. Geuvers and M.-J. Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1:155-189, 1991.
19. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of LIGS'91, pages 350-361. IEEE Computer Society Press, 1991.
20. J.-P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349-391, 1997.
21. J.W. Klop. Combinatory reduction systems. Number 127 in Mathematical Centre Tracts. CWI, 1980.
22. J.W. Klop. Term-rewriting systems. In S. Abramsky, D. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, pages 1-116. Oxford Science Publications, 1992. Volume 2.
23. K. Meinke and J.V. Tucker, editors. Many sorted logic and its applications. John Wiley and Sons, 1993.
24. J. van de Pol. Termination of higher-order rewrite systems. PhD thesis, University of Utrecht, 1996.
25. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17(l):23-50, January 1994.