论文信息 - A Formal Operational Semantics for Languages of Type Prolog III

A Formal Operational Semantics for Languages of Type Prolog III

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 [Borger 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.

Peter H. Schmitt | Egon Börger

[1] Yuri Gurevich,et al. Algebraic Operational Semantics and Occam , 1990, CSL.

[2] Joxan Jaffar,et al. Methodology and Implementation of a CLP System , 1987, ICLP.

[3] Alain Colmerauer,et al. Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[4] Egon Börger,et al. A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation , 1990, MFCS.

[5] Yuri Gurevich,et al. Algebraic Operational Semantics and Modula-2 , 1987, CSL.

[6] Alain Colmerauer,et al. An introduction to Prolog III , 1989, CACM.

[7] Egon Börger,et al. A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control , 1989, CSL.