Skip to main content
SpringerLink
Log in

Termination of algebraic type systems: The syntactic approach

  • Types
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1997, HOA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1298))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baxbanera and M. FernSndez. 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.

    Google Scholar 

  2. F. Barbanera and M. FernSndez. Modularity of termination and confluence in combinations of rewrite systems with λω In A. Lingas, R. Karlsson, and S. Karlsson, editors, Proceedings of ICALP'93, volume 700 of Lecture Notes in Computer Science, pages 657–668. Springer-Verlag, 1993.

    Google Scholar 

  3. F. Barbanera and M. Fernández. Intersection type assignment systems with higherorder algebraic rewriting. Theoretical Computer Science, 170(1–2):173–207, 15 December 1996.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  6. G. Baxthe and H. Geuvers. Congruence types. In H. Kleine Buening, editor, Proceedings of CSL'95, volume 1092 of Lecture Notes in Computer Science, pages 36–51. Springer-Verlag, 1996.

    Google Scholar 

  7. G. Baxthe 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.

    Google Scholar 

  8. G. Barthe, J. Hatcliff, and M.H. Sørensen. Weak Normalization implies Strong Normalization in Generalized Non-Dependent Pure Type Systems. Draft, 1997.

    Google Scholar 

  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.

    Google Scholar 

  10. G. Barthe, M. Ruys, and H. Barendregt. A two-level approach towards lean proofchecking. 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.

    Google Scholar 

  11. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of LICS'88, pages 82–90. IEEE Computer Society Press, 1988.

    Google Scholar 

  12. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalisation. Theoretical Computer Science, 83:3–28, 1990.

    Google Scholar 

  13. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95–120, February/March 1988.

    Google Scholar 

  14. R. Di Cosmo. A brief history of rewriting with extensionality. In F. Kamareddine, editor, International Summer School on Type Theory and Term Rewriting, Glasgow, September 1996. Kluwer, 199x. To appear.

    Google Scholar 

  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.

    Google Scholar 

  16. D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101:251–267, 1992.

    Google Scholar 

  17. M. Fernandez. Modèles de calcul multiparadigmes fondès sur la réécriture. PhD thesis, Université Paris-Sud Orsay, 1993.

    Google Scholar 

  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.

    Google Scholar 

  19. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages.In Proceedings of LICS'91, pages 350–361. IEEE Computer Society Press, 1991.

    Google Scholar 

  20. J.-P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349–391, 1997.

    Google Scholar 

  21. J.W. Klop. Combinatory reduction systems. Number 127 in Mathematical Centre Tracts. CWI, 1980.

    Google Scholar 

  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.

    Google Scholar 

  23. K. Meinke and J.V. Tucker, editors. Many sorted logic and its applications. John Wiley and Sons, 1993.

    Google Scholar 

  24. J. van de Pol. Termination of higher-order rewrite systems. PhD thesis, University of Utrecht, 1996.

    Google Scholar 

  25. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17(1):23–50, January 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands

    Gilles Baxthe & Femke van Raamsdonk

Authors
  1. Gilles Baxthe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Femke van Raamsdonk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Jan Heering Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baxthe, G., van Raamsdonk, F. (1997). Termination of algebraic type systems: The syntactic approach. In: Hanus, M., Heering, J., Meinke, K. (eds) Algebraic and Logic Programming. ALP HOA 1997 1997. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027010

Download citation

  • DOI: https://doi.org/10.1007/BFb0027010

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63459-1

  • Online ISBN: 978-3-540-69555-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation