Skip to main content
SpringerLink
Log in

Modeling Meta-logical Features in a Calculus with Frozen Variables

  • Conference paper
  • First Online:
Proof Theory in Computer Science (PTCS 2001)

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

Included in the following conference series:

  • 278 Accesses

Abstract

We consider logic programming computations involving meta-logical predicates and connectives. The meaning of these elements depends on structural properties of the arguments, e.g. being an uninstantiated variable or a ground term when the goal is called, or involve success / failure conditions for the components which relates them to control. To model these effects we use a substructural calculus and introduce a binding mechanism at the level of sequents called freezing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Baudinet. Proving termination properties of Prolog programs: A semantic approach. Journal of Logic Programming, 14(1 and 2):1–29, October 1992.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Börger and D. Rosenzweig. A mathematical definition of full Prolog. Science of Computer Programming, 24(3):249.

    Google Scholar 

  3. S. K. Debray and P. Mishra. Denotational and operational semantics for Prolog. Journal of Logic Programming, 5(1):61–91, March 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Elbl. A declarative semantics for depth-first logic programs. Journal of Logic Programming, 41(1):27–66, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Elbl. Lazy list comprehension in logic programming. Journal of Logic and Computation, (to appear).

    Google Scholar 

  6. B. Elbl. A non-definability result for a predicational language with the usual control. International Journal of Foundations of Computer Science, 12(3):385–396, 2001.

    Article  MathSciNet  Google Scholar 

  7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.

    Google Scholar 

  8. N. D. Jones and A. Mycroft. Stepwise development of operational and denotational semantics for Prolog. In Proceedings of the 1984 International Symposium on Logic Programming, pages 281–288. IEEE, 1984.

    Google Scholar 

  9. G. E. Mints. Complete calculus for pure prolog. Proc. Acad. Sci. Estonian SSR, 35(4):367–380, 1986.

    MATH  MathSciNet  Google Scholar 

  10. P. Schroeder-Heister. Definitional reflection and the completion. In R. Dyckhoff, editor, Extensions of Logic Programming. Fourth International Workshop, St. Andrews, Scotland, April 1993, Proceedings, Springer Lecture Notes in Artificial Intelligence, pages 333–347, 1994.

    Google Scholar 

  11. J. Shepherdson. Mints type deductive calculi for logic programming. Annals of Pure and Applied Logic, 56:7–17, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. Sterling and E. Y. Shapiro. The Art of Prolog. MIT Press, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Institut für Theoretische Informatik und Mathematik, UniBw München, 85577, Neubiberg, Germany

    Birgit Elbl

Authors
  1. Birgit Elbl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Reinhard Kahle  & Peter Schroeder-Heister  & 

  2. Theoretische Informatik, ETH Zürich, ETH Zentrum, 8092, Zürich, Switzerland

    Robert Stärk

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elbl, B. (2001). Modeling Meta-logical Features in a Calculus with Frozen Variables. In: Kahle, R., Schroeder-Heister, P., Stärk, R. (eds) Proof Theory in Computer Science. PTCS 2001. Lecture Notes in Computer Science, vol 2183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45504-3_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45504-3_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42752-0

  • Online ISBN: 978-3-540-45504-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation