Retractions in comparing prolog semantics (extended abstract)

  • A. de Bruin
  • E. P. de VINK
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)


We present an operational model O and a continuation based denotational model D for a uniform variant of Prolog, including the cut operator. The two semantical definitions make use of higher order transformations Φ and Ψ, respectively. We prove O and D equivalent in a novel way by comparing yet another pair of higher order transformations Φ and Ψ, that yield Φ and Ψ, respectively, by application of a suitable abstraction operator.


Operational Semantic Unique Fixed Point Abstract Machine Abstract Domain Denotational Semantic 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ba1]
    J.W. de Bakker, Mathematical Theory of Program Correctness, Prentice Hall International, London (1980).Google Scholar
  2. [Ba2]
    J.W. de Bakker, “Designing Concurrency Semantics,” pp. 591–598 in Proc. 11th World Computer Congress, G.X. Ritter (ed.) (1989).Google Scholar
  3. [BBKM]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch Meyer, “Linear Time and Branching Time Semantics for Recursion with Merge,” Theoretical Computer Science 34, pp. 135–156 (1984).Google Scholar
  4. [BM]
    J.W. de Bakker and J.-J.Ch. Meyer, “Metric Semantics for Concurrency,” BIT 28, pp. 504–529 (1988).Google Scholar
  5. [BMZ]
    J.W. de Bakker, J.-J.Ch Meyer, and J.I Zucker, “On Infinite Computations in Denotational Semantics,” Theoretical Computer Science 26, pp. 53–82 (1983).Google Scholar
  6. [BV1]
    A. de Bruin and E.P. de Vink, “Continuation Semantics for Prolog with Cut,” pp. 178–192 in Proc. TAPSOFT'89, volume 1, J. Díaz & F. Orejas (eds.), LNCS 351 (1989).Google Scholar
  7. [BV2]
    A. de Bruin and E.P. de Vink, “Retractions in Comparing Prolog Semantics,” Report IR-198, Vrije Universiteit, Amsterdam (1989).Google Scholar
  8. [KR]
    J.N. Kok and J.J.M.M. Rutten, “Contractions in Comparing Concurrency Semantics,” pp. 317–332 in Proc. ICALP'88, T. Lepistö & A. Salomaa (eds.), LNCS 317 (1988).Google Scholar
  9. [Me]
    J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Dissertation, Vrije Universiteit, Amsterdam (1985).Google Scholar
  10. [MV]
    J.-J.Ch. Meyer and E.P. de Vink, “Applications of Compactness in the Smyth Powerdomain of Streams,” Theoretical computer Science 57, pp. 251–282 (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • A. de Bruin
    • 1
  • E. P. de VINK
    • 2
  1. 1.Faculty of Economics, Erasmus UniversiteitRotterdam
  2. 2.Dept. of Math. and Comp. Sc.Vrije UniversiteitAmsterdam

Personalised recommendations