Advertisement

A formal operational semantics for languages of type Prolog III

  • E. Börger
  • Peter H. Schmitt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 533)

Abstract

We use dynamic algebras introduced by Gurevich in [Gurevich 1988], [Gurevich 1991] to develop a formal semantics for the logical core of constraint logic programming languages of type Prolog III [Colmerauer 1990]. Our specification abstracts away from any particular feature of the mechanism for the resolution of constraints, thus providing a uniform description of constraint logic programming languages which turns out to be a natural refinement of the standard Prolog algebras developed in [Börger 1990]. In particular we show how our method can be used for a precise but simple method to handle specification problems connected to the freeze predicate.

Keywords

Operational Semantic Transition Rule Constraint System Success Rule Constraint Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Blakley,R. 1990: Ph.D. Thesis. University of Michigan at Ann Arbor (in preparation)Google Scholar
  2. Börger, E. 1990: A Logical Operational Semantics of Full PROLOG, Part I. Selection Core and Control, CSL'89.3rd workshop on Computer Science Logic (Eds. E.Boerger, H.Kleine Buening, M. Richter), Springer Lecture Notes in Computer Science, 1989, Vol. 440, pp. 36–64Google Scholar
  3. Börger, E. 1990a: A Logical Operational Semantics of Full PROLOG,Part II. Built-in Predicates for Database Manipulations, Proc. of MFCS 1990, Springer Lecture Notes in Computer Science, Vol. 452, pp. 1–14Google Scholar
  4. Börger, E. 1990b:A Logical Operational Semantics of Full PROLOG,Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output Proc. of the workshop on "Logic from Computer Science", Berkely 1989, (Ed. Y. Moschovakis) to appear in MSRI Series, Springer Verlag 1991Google Scholar
  5. Colmerauer, A. 1984: Equations and Inequations on Finite and Infinite Trees. Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo 1984, p. 85Google Scholar
  6. Colmerauer A. 1990: An Introduction to Prolog III. Comm. of the ACM, 33(7), July 1990, pp. 69–90.CrossRefGoogle Scholar
  7. Gurevich, Y. 1988: Logic and the Challenge of Computer Science, in: Trends in Theoretical Computer Science (E. Börger, ed.), Computer Science Press, 1988, pp. 1–57Google Scholar
  8. Gurevich, Y. 1991:Evolving Algebras. A Tutorial Introduction, in., EATCS BULL. FEB. 1991.Google Scholar
  9. Gurevich, Y. & Morris, J. M. 1988: Algebraic Operational Semantics and Modula-2 in: CSL '87 1st Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter) Springer LNCS 329, pp. 81–101Google Scholar
  10. Gurevich, Y. & Moss, J. M. 1990: Algebraic Operational Semantics and Occam in: CSL '89 3rd Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter), Springer LNCS 440, pp. 176–192.Google Scholar
  11. Jaffar, J. & Michaylov, S. 1987: Methodology and Implementation of a CLP-System. Proc. 4th Int. Conference on Logic Programming, Melbourne 1987Google Scholar
  12. Morris, J. 1988: Algebraic Operational Semantics for Modula 2. Ph.D. Thesis. The University of Michigan at Ann Arbor.Google Scholar
  13. PrologIA 1990: Prolog III, Version 1.1., Reference and User's Manual, Prolog IA, Luminy, Case 919, 13288, Marseille cedex 09, FranceGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • E. Börger
    • 1
  • Peter H. Schmitt
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly
  2. 2.Fakultät für InformatikUniversität KarlsruheGermany

Personalised recommendations