Skip to main content

A relational-functional integration for declarative programming

  • Chapter
  • First Online:
Foundations of Computer Science

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

  • 273 Accesses

Abstract

A relational-functional kernel language is introduced that integrates essential declarative constructs: logic variables and nondeterminism from the relational paradigm with nested and higher-order operations from the functional paradigm. Operator definitions use ‘valued clauses”, subsuming relational Horn clauses and functional (conditional or unconditional) directed equations. Their semantics complements the atoms in relational Herbrand models by “molecules”, which pair functions, applied to argument terms, with returned-value terms. All abstract notions are illustrated by concrete declarative programs.

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. Harold Boley. Extended Logic-plus-Functional Programming. In Lars-Henrik Eriksson, Lars Hallnäs, and Peter Schroeder-Heister, editors, Proceedings of the 2nd International Workshop on Extensions of Logic Programming, ELP '91, Stockholm 1991, volume 596 of LNAI. Springer, 1992.

    Google Scholar 

  2. Harold Boley. A Direct Semantic Characterization of RELFUN. In E. Lamina and P. Mello, editors, Proceedings of the 3rd International Workshop on Extensions of Logic Programming, ELP '92, Bologna 1992, volume 660 of LNAI. Springer, 1993.

    Google Scholar 

  3. Harold Boley, Markus Perling, and Michael Sintek. Transforming Workpiece Geometries into Lathe-NC Programs by Qualitative Simulation. In 15th IMACS World Congress on Scientific Computation, Modelling and Applied Mathematics. Wissenschaft und Technik Verlag, Berlin, August 1997.

    Google Scholar 

  4. Michael Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19,20:583–628, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. Michael Hanus. A Unified Computation Model for Functional and Logic Programming. In POPL'97, Paris 1997.

    Google Scholar 

  6. John W. Lloyd. Combining Functional and Logic Programming Languages. In 1994 International Logic Programming Symposium, ILPS'94.

    Google Scholar 

  7. J. A. Robinson and E. E. Sibert. LOGLISP: An Alternative to Prolog. Machine Intelligence, 10:399–419, 1982.

    Google Scholar 

  8. Peter Van Roy. 1983–1993: The Wonder Years of Sequential Prolog Implementation. The Journal of Logic Programming, 19, 20:385–441, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Boley, H. (1997). A relational-functional integration for declarative programming. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052103

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

  • Online ISBN: 978-3-540-69640-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics