Skip to main content
SpringerLink
Log in

Implementing a meta-logical scheme

  • Constraint Logic Programming
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1990)

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

  • 157 Accesses

Abstract

When working with programming languages, it is often necessary to have meta-programs, such as compilers or interpreters, which can manipulate programs in those languages. The semantics of meta-programs for Constraint Logic Programming (CLP) languages have been problematic, but Lim and Stuckey have presented an approach which allows such meta-programs to be themselves treated as constraint logic programs; for each CLP language CLP(X), there is a meta-language, CLP(meta(X)).

This paper describes how to implement these CLP(meta(X)) languages by translation into PROLOG-like languages. To illustrate how such implementations work, a meta-interpreter is used as an example meta-program.

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. K. A. Bowen and R. A. Kowalski, “Amalgamating language and metalanguage in logic programming”, in Logic Programming, K. L. Clark and S.-A. Tarnlund, editors, Academic Press, London, 1982, pp. 153–172.

    Google Scholar 

  2. S. Costantini and G. A. Lanzarone, “A Metalogic Programming Language”, Proceedings of 6th International conference on Logic Programming, Lisbon, Portugal, June 1989, pp. 218–233.

    Google Scholar 

  3. T. Hickey, “CLP* and Constraint Abstraction”, Procs. Logic in Computer Science, Chicago 1989.

    Google Scholar 

  4. P. M. Hill and J. W. Lloyd, “Analysis of Meta-Programs”, Proceedings of the Meta88 Workshop on Meta-Programming in Logic Programming, Bristol, June 1988, pp. 23–51.

    Google Scholar 

  5. J. Jaffar and J-L. Lassez, “Constraint Logic Programming”, Procs. POPL 87, Munich, January 1987.

    Google Scholar 

  6. P. Lim and P. J. Stuckey, “Meta-Programming as Constraint Programming”, North American Conference on Logic Programming, Austin, October 1990.

    Google Scholar 

  7. J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, 1984.

    Google Scholar 

  8. L. Sterling and E. Shapiro, “The Art of Prolog”, MIT Press, U.S.A., 1986.

    Google Scholar 

  9. J. A. Thom and J. Zobel (eds.), “NU-Prolog Reference Manual”, Dept. of Computer Science Technical Report 86/10, University of Melbourne, May 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Monash University, 3168, Clayton, Australia

    Pierre Lim

  2. Australian Artificial Intelligence Institute, 1 Grattan Street, 3053, Carlton, Australia

    David Morley

Authors
  1. Pierre Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Morley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, P., Morley, D. (1990). Implementing a meta-logical scheme. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024179

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46298-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation