Skip to main content
SpringerLink
Log in

Translating Relational Programs into Prolog

  • Chapter
Relational Methods for Computer Science Applications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 65))

Abstract

The binary relation algebra has operators that correspond to wellknown programming constructs. As a result, it is to possible base useful programming languages on it. An earlier paper by the author described such a language. Since Prolog predicates define relations between variables, Prolog is often considered to be a relational language. In fact, there are several straight-forward translations from relation algebra expressions to Prolog rules. This paper explores this idea in depth, showing how relation algebra can be translated into Prolog.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Backus J. (1978) Can Programming be Liberated from the Von Neumann Style? Communications of the ACM, 21(8):613–641

    Article  MathSciNet  MATH  Google Scholar 

  2. Bird R., Scruggs T.E., Mastropieri M.A. (1998) Introduction to Functional Programming Using Haskell. (Prentice Hall)

    Google Scholar 

  3. Cattrall D.M. (1992) The Design and Implementation of a Relational Programming System. PhD Thesis, Dept. of Computer Science, University of York

    Google Scholar 

  4. Dwyer B. (1994) Programming Using Binary Relations: a proposed programming language. Technical Report 94–04, Dept. of Computer Science, University of Adelaide

    Google Scholar 

  5. Dwyer B. (1995) LIBRA: A Lazy Interpreter of Binary Relational Algebra. Technical Report 95–10, Dept. of Computer Science, University of Adelaide. (Also available via http://www.cs.adelaide.edu.au/∼dwyer.)

    Google Scholar 

  6. Gabber E. (1990) Developing a Portable Parallelizing Pascal Compiler in Prolog. In: Sterling L. (Ed.) The Practice of Prolog, 109–136

    Google Scholar 

  7. Milner R. (1978) A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348–375

    Article  MathSciNet  MATH  Google Scholar 

  8. O’Keefe R.A. (1990) The Craft of Prolog. MIT Press, Cambridge, Mass.

    Google Scholar 

  9. Potter B., Sinclair J. and Till D. (1991) An Introduction to Formal Specification and Z. Prentice-Hall

    MATH  Google Scholar 

  10. Sanderson J.G. (1980) A Relational Theory of Computing. Lecture Notes in Computer Science 82, Springer-Verlag Berlin

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Adelaide, Adelaide, South Australia, 5005

    Barry Dwyer

Authors
  1. Barry Dwyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Telecommunications, ul. Szachowa 1, 04-894, Warsaw, Poland

    Ewa Orłowska

  2. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dwyer, B. (2001). Translating Relational Programs into Prolog. In: Orłowska, E., Szałas, A. (eds) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol 65. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1828-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1828-4_2

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-662-00362-6

  • Online ISBN: 978-3-7908-1828-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation