Skip to main content

Retractions in comparing prolog semantics (extended abstract)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

  • 760 Accesses

Abstract

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.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. de Bakker, Mathematical Theory of Program Correctness, Prentice Hall International, London (1980).

    Google Scholar 

  2. J.W. de Bakker, “Designing Concurrency Semantics,” pp. 591–598 in Proc. 11th World Computer Congress, G.X. Ritter (ed.) (1989).

    Google Scholar 

  3. 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. J.W. de Bakker and J.-J.Ch. Meyer, “Metric Semantics for Concurrency,” BIT 28, pp. 504–529 (1988).

    Google Scholar 

  5. 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. 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. A. de Bruin and E.P. de Vink, “Retractions in Comparing Prolog Semantics,” Report IR-198, Vrije Universiteit, Amsterdam (1989).

    Google Scholar 

  8. 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. J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Dissertation, Vrije Universiteit, Amsterdam (1985).

    Google Scholar 

  10. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Bruin, A., de VINK, E.P. (1990). Retractions in comparing prolog semantics (extended abstract). In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029606

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics