Skip to main content
SpringerLink
Log in

Higher-order superposition for dependent types

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1996)

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

Included in the following conference series:

Abstract

We describe a proof of the Critical Pair Lemma for Plotkin's LF calculus [4]. Our approach basically follows the one used by Nipkow [12] for the simply-typed case, though substantial modifications and some additional theoretical machinery are needed to ensure well-typedness of rewriting in this richer type system. We conclude the paper presenting some significant applications of the theory.

This work was supported by NSF Grant CCR-9303383.

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. Coquand, T. An algorithm for Testing Conversion in Type Theory. Logical Frameworks, Cambridge University Press, 1991, pages 155–279

    Google Scholar 

  2. Gehrke, W., Decidability Results For Categorical Notions Related to Monads by Rewriting Techniques Ph.D. Thesis, Johannes Kepler Universität, Linz, 1995

    Google Scholar 

  3. Geuvers, H. The Church-Rosser Property for βη-Reduction in Typed λ-Calculi. Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS), 1992, pages 453–460

    Google Scholar 

  4. Harper, R., Honsell F., Plotkin, G. A framework for Defining Logics. Journal of the Association for Computing Machinery, January 1993, pages 143–184

    Google Scholar 

  5. Huet, G.P., Lang, B. Proving and Applying Program Transformations Expressed with Second-Order Patterns Acta Informatica 11, 1978, pages 31–55

    Article  Google Scholar 

  6. Kahrs, D. Towards a Domain Theory for Termination Proofs. Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA), 1995, pages 241–255

    Google Scholar 

  7. Knuth, D.E., Bendix, P.B. Simple Word Problems in Universal Algebra. Computational Problems in Abstract Algebra, Pergamon Press, 1972, pages 263–297

    Google Scholar 

  8. Loría-Sáenz, C. A. A Theoretical Framework for Reasoning about Program Construction Based on Extensions of Rewrite Systems Ph.D. Thesis, Universität Kaiserslautern, 1993

    Google Scholar 

  9. Mayr, R., Nipkow, T. Higher-Order Rewrite Systems and their Confluence. Technical Report TUM-I9433, Technische Universität München, 1994

    Google Scholar 

  10. Miller, D. A Logic Programming Language With Lambda abstraction, Function Variables, and Simple Unification. LFCS Report Series, University of Edinburgh, 1991, pages 253–281

    Google Scholar 

  11. Newman, M.H.A. On theories with a combinatorial definition of ‘equivalence' Annals of Mathematics, 43(2), 1942, pages 223–243

    Google Scholar 

  12. Nipkow, T. Higher-Order Critical Pairs. Proceedings of the 5th IEEE Conference of Logic In Computer Science (LICS), 1990, pages 342–348

    Google Scholar 

  13. Paulson, L.C. The Foundation of a Generic Theorem Prover Journal of Automated Reasoning, vol. 5, 1989, pages 363–397

    Article  Google Scholar 

  14. Pfenning, F. Logic Programming in the LF Logical Framework. G. Huet, G. Plotkin ed., Logical Frameworks, Cambridge University Press, 1991, pages 149–181

    Google Scholar 

  15. Pfenning, F. Unification and anti-unification in the Calculus of Constructions., Proceedings of the 6th IEEE Conference of Logic In Computer Science (LICS), 1991, pages 149–181

    Google Scholar 

  16. Pfenning, F. A Structural Proof of Cut Elimination and Its Representation in a Logic Framework Technical Report CMU-CS-94-218, Carnegie Mellon University, 1994

    Google Scholar 

  17. Pol, J. Termination Proofs for Higher-Order Rewrite Systems, J. Heering, K. Meinke, B. Moller, T. Nipkow ed., Higher Order Algebra, Logic and Term Rewriting (HOA),Lecture Notes in Computer Science, vol 816, 1994, pages 305–325

    Google Scholar 

  18. Prehofer, C. Solving Higher-Order Equations., Technical Report, Technische Universität München, 1994

    Google Scholar 

  19. Rohwedder, E., Pfenning, F. Mode and Termination Analysis for Higher-Order Logic, to appear at the 1996 European Symposium on Programming (ESOP)

    Google Scholar 

  20. Salvesen, A. The Church-Rosser Property for Pure Systems with βη-Reduction. Technical Report, University of Oslo, 1992

    Google Scholar 

  21. Virga, R. Higher-Order Superposition for Dependent Types, Technical Report CMU-CS-95-150, Carnegie Mellon University, 1995 (http://www.cs.cmu.edu/afs/cs.cmu.edu/user/rvirga/Web/dep-rel.ps)

    Google Scholar 

  22. Wolfram, D.A Rewriting, and Equational Unification: the Higher-Order Cases Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA), 1991, pages 25–36

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Roberto Virga

Authors
  1. Roberto Virga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Harald Ganzinger

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Virga, R. (1996). Higher-order superposition for dependent types. In: Ganzinger, H. (eds) Rewriting Techniques and Applications. RTA 1996. Lecture Notes in Computer Science, vol 1103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61464-8_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-61464-8_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61464-7

  • Online ISBN: 978-3-540-68596-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation