Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theorem Proving in Higher Order Logics

TPHOLs 1998: Theorem Proving in Higher Order Logics pp 263–276Cite as

Free variables and subexpressions in higher-order meta logic

  • Refereed Papers
  • Conference paper
  • First Online:

  • 103 Accesses

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

Abstract

This paper addresses the problem of how to represent free variables and subexpressions involving Β-bindings. The aim is to apply what is known as higher-order abstract syntax to higher-order term rewriting systems. Directly applying Β-reduction for the purpose of subterm-replacement is incompatible with the requirements of term-rewriting. A new meta-level representation of subterms is developed that will allow term-rewriting systems to be formulated in a higher-order meta logic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Thierry Coquand and Gérard Huet. The calculus of constructions. Information and Computation, 76(2/3):95–120, February/March 1988.

    Article  MATH  MathSciNet  Google Scholar 

  2. JoËlle Despeyroux, Amy Felty, and André Hirschowitz. Higher-order abstract syntax in Coq. In Second International Conference on Typed Lambda Calculi and Applications, pages 124–138. Springer-Verlag Lecture Notes in Computer Science, April 1995.

    Google Scholar 

  3. Amy Felty. A logic programming approach to implementing higher-order term rewriting. In Lars-Henrik Eriksson, Lars HallnÄs, and Peter Schroeder-Heister, editors, Proceedings of the January 1991 Workshop on Extensions to Logic Programming, volume 596 of Lecture Notes in Artificial Intelligence, pages 135–161. Springer-Verlag, 1992.

    Google Scholar 

  4. Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43–81, August 1993.

    Article  MATH  MathSciNet  Google Scholar 

  5. John Hannan. Extended natural semantics. Journal of Functional Programming, 3(2):123–152, April 1993.

    Article  MathSciNet  Google Scholar 

  6. P. M. Hill and J. G. Gallagher. Meta-programming in logic programming. Technical Report Report 94.22, University of Leeds, hill@scs.leeds.ac.uk, August 1994. To appear in Vol. 5 of the Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press.

    Google Scholar 

  7. Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  8. Chuck Liang. Substitution, Unification and Generalization in Meta-Logic. PhD thesis, University of Pennsylvania, September 1995.

    Google Scholar 

  9. Chuck Liang. Let-polymorphism and eager type schemes. In TAPSOFT '97: Theory and Practice of Software Development, pages 490–501. Springer Verlag LNCS Vol. 1214, 1997.

    Google Scholar 

  10. R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In Symposium on Logic in Computer Science. IEEE, 1997.

    Google Scholar 

  11. Dale Miller. Abstractions in logic programming. In Piergiorgio Odifreddi, editor, Logic and Computer Science, pages 329–359. Academic Press, 1990.

    Google Scholar 

  12. Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.

    MATH  MathSciNet  Google Scholar 

  13. Dale Miller. Unification under a mixed prefix. Journal of Symbolic Computation, pages 321–358, 1992.

    Google Scholar 

  14. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  15. Tobias Nipkow. Higher-order critical pairs. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 342–349. IEEE, July 1991.

    Google Scholar 

  16. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363–397, September 1989.

    Article  MATH  MathSciNet  Google Scholar 

  17. Frank Pfenning and Conal Elliot. Higher-order abstract syntax. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199–208. ACM Press, June 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Trinity College, 300 Summit Street, 06106-3100, Hartford, CT, USA

    Chuck Liang

Authors
  1. Chuck Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jim Grundy Malcolm Newey

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liang, C. (1998). Free variables and subexpressions in higher-order meta logic. In: Grundy, J., Newey, M. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1998. Lecture Notes in Computer Science, vol 1479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055141

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64987-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation