Skip to main content
SpringerLink
Log in
Book cover

Declarative Programming, Sasbachwalden 1991 pp 51–65Cite as

Enriching Prolog with S-Unification

  • Conference paper

  • 36 Accesses

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

The concept of S-unification provides a semantically clean way of combining logic programs with functions written in other languages. This paper shows how to implement a logic programming language with S-unification by transforming it to a Prolog program. The scheme is reasonably efficient if Prolog supports efficient coroutining.

(on leave from the Institute of Informatics, Warsaw University)

S-581 83 Linköping, Sweden. email: andka@ida.liu.se

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Aït-Kaci, P. Lincoln, and R. Nasr. Le Fun: Logic, Equations and Functions. In Proc. Symposium on Logic Programming [IEE87].

    Google Scholar 

  2. R. Barbuti, M. Bellia, G. Levi, and M. Martelli. LEAF: a Language which integrates Logic, Equations and Functions. In DeGroot and Lindstrom [DL86].

    Google Scholar 

  3. S. Bonnier and J. Małuszyński. Towards a Clean Amalgamation of Logic Programs with External Procedures. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming, Proc. of the fifth International Conference and Symposium, Seatle, 1988. ALP, IEEE, MIT Press.

    Google Scholar 

  4. Staffan Bonnier. Horn Clause Logic with External Procedures: Towards a Theoretical Framework. Licentiate thesis, Linköping University, Dep. of Computer and Information Science, S-581 83 Linköping, Sweden, 1989.

    Google Scholar 

  5. Staffan Bonnier, 1991. Personal communication.

    Google Scholar 

  6. Johan Boye. Operational completeness of logic programs with external procedures. Master’s thesis, Linköping University, Dep. of Computer and Information Science, S-581 83 Linköping, Sweden, 1991. Report no: LiTH-IDA-Ex-9104.

    Google Scholar 

  7. Mats Carlsson. Freeze, indexing, and other implementation issues in the WAM. In Jean-Louis Lassez, editor, Logic Programming, Proc. of the Fourth International Conference, pages 40–58, Melbourne, 1987. MIT Press.

    Google Scholar 

  8. S. Cohen. The APPLOG Language. In DeGroot and Lindstrom [DL86].

    Google Scholar 

  9. Alain Colmerauer. Prolog II - manuel de référence et modèle théoretique. Technical report, Groupe d’Intelligence Artificielle, Université d’Aix-Marseille I I, 1982.

    Google Scholar 

  10. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language chip. In Proc. of the International Conference on Fifth Generation Computer Systems,pages 693–702, Tokyo, 1988. Institute for New Generation Computer Technology, Ohmsha, Ltd.

    Google Scholar 

  11. D. DeGroot and G. Lindstrom, editors. Logic programming, functions, relations and equations. Prentice-Hall, 1986.

    Google Scholar 

  12. J. Goguen and J. Meseguer. EQLOG: Equality, Types and Generic Modules for Logic Programming. In DeGroot and Lindstrom [DL86].

    Google Scholar 

  13. P. V. Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

  14. IEEE. Proc. Symposium on Logic Programming, San Francisco, 1987. Computer Society Press.

    Google Scholar 

  15. J. Jaffar and J.L. Lassez. Constraint Logic Programming. In 14th ACM POPL Con f. ACM, 1987.

    Google Scholar 

  16. J. Komorowski. QLOG - The Programming Environment for Prolog in LISP. In K.L. Clark and S.-A. Tärnlund, editors, Logic Programming. Prentice-Hall, 1982.

    Google Scholar 

  17. C. Mellish and S. Hardy. Integrating Prolog in the Poplog Environment. In J. Campbell, editor, Implementations of Prolog. Ellis Horwood, 1984.

    Google Scholar 

  18. J. Robinson and E. Sibert. LOGLISP: Motivation, Design and Implementation. In K. Clark and S.-Å. Tärnlund, editors, Logic Programming. Prentice-Hall, 1982.

    Google Scholar 

  19. D.W. Shin, J.H. Nang, S. Han, and S.R. Maeng. A Functional Logic Language based on Canonical Unification. In Proc. Symposium on Logic Programming [IEE87], pages 328–333.

    Google Scholar 

  20. P. Subrahmanyam and J-H. You. Funlog: A computational model integrating logic programming and functional programming. In De-Groot and Lindstrom [DL86].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer and Information Science, Linköping University, Sweden

    Andreas Kågedal & Feliks Kluźniak

Authors
  1. Andreas Kågedal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feliks Kluźniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, SW7 2BZ, London, UK

    John Darlington BSc (Hons), PhD

  2. GMD Forschungsstelle, Universität Karlsruhe, Vincenz-Prießnitz-Straße 1, D-7500, Karlsruhe 1, Germany

    Roland Dietrich (Dr. rer. nat.) (Dr. rer. nat.)

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag London

About this paper

Cite this paper

Kågedal, A., Kluźniak, F. (1992). Enriching Prolog with S-Unification. In: Darlington, J., Dietrich, R. (eds) Declarative Programming, Sasbachwalden 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3794-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3794-8_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19735-5

  • Online ISBN: 978-1-4471-3794-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation