Skip to main content
Springer Nature Link
Log in

On the semantics of logic programming languages

  • Session 3b: Theory And Semantics
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. van Emden M.H. and Kowalski R.A., The Semantics of Predicate Logic as a Programming Language, Journal of the ACM 23(4), 1976.

    Google Scholar 

  2. van Emden, M.H., An Interpreting Algorithm for Prolog Programs, in Proc. 1st Int. Logic Programming Conf., Marseille, 1982.

    Google Scholar 

  3. Jones N.D. and Mycroft A., Stepwise Development of Operational and Denotational Semantics for Prolog, in Proc. 1984 Int. Symp. on Logic Programming, Atlantic City, N.J., 1984.

    Google Scholar 

  4. Fuchi K., Logical Derivation of a Prolog Interpreter, in Proc.of the Int. Conf. on 5th. Generation Computer Systems 1984, Tokyo, Japan, Nov. 6–9, 1984.

    Google Scholar 

  5. Carlsson, M. On Implementing Prolog in Functional Programming, in Proc. 1984 Int. Symp. on Logic Programming, Atlantic City, N.J., 1984.

    Google Scholar 

  6. Bruynooghe, M. The memory management of PROLOG implementations; in Logic Programming (K.L. Clark and S-A. Tarnlund eds.), Academic Press, 1982, 83–98.

    Google Scholar 

  7. Mellish, C.S. An Alternative to Structure Sharing in the Implementation of a Prolog Interpreter; in Logic Programming (K.L. Clark S-A. Tarnlund eds.), Academic Press, 1982, 99–106.

    Google Scholar 

  8. Warren, D.H.D., Implementing Prolog — compiling predicate logic programs, DAI research report 39–40, Dept. of A.I., Edinburgh Univ., 1977.

    Google Scholar 

  9. Colmerauer, A. Prolog and Infinite Trees; Logic Programming (K.L. Clark and S-A. Tarnlund eds.), Academic Press, 1982.

    Google Scholar 

  10. Apt,K.R. and van Emden, M.H. Contributions to the theory of logic programming, Journal of the ACM 29(3), 1982.

    Google Scholar 

  11. Martelli, A. and Rossi, G., Efficient Unification with Infinite Terms in logic Programming, in Proc.of the Int. Conf. on 5th. Generation Computer Systems 1984, Tokyo, Japan, Nov. 6–9, 1984.

    Google Scholar 

  12. Martelli, A. and Montanari, U., An Efficient Unification Algorithm, ACM TOPLAS, 4, 2 (April 1982).

    Google Scholar 

  13. Bowen, K.A., Meta-Level Programming and Knowledge Representation, New Generation Computing, 3 (1985), pp. 359–383.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universita' di Torino, Via Valperga Caluso, 37, 10125, Torino

    Alberto Martelli & Gianfranco Rossi

Authors
  1. Alberto Martelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianfranco Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martelli, A., Rossi, G. (1986). On the semantics of logic programming languages. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics