Skip to main content
SpringerLink
Log in

Types, modularisation and abstraction in logic programming

  • Submitted Papers
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1988)

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

Included in the following conference series:

Abstract

A simple and efficient way that the ideas of typing, modularisation and data abstraction can be realised in a logic programming framework, which also remains within the spirit of logic programming, is proposed here. A polymorphic type system with subtypes is presented and it is shown how it can form the basis for modular structure. The ideas are presented as an extension to PROLOG, which is taken as a practical representative of logic programming. Additionally, they have been implemented in a skeleton language on top of standard PROLOG.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Berztiss, A. & S. Thatte. Specification and Implementation of Abstract Data Types. Advances in Computers, Vol.22, pp.295–353, 1983.

    Article  MathSciNet  Google Scholar 

  2. Clark, K. & S. Tarnlund. A first order theory of data and programs. Information Processing (IFIP) '77, North-Holland, pp.939–944, 1977.

    Google Scholar 

  3. Clocksin, W.F. & C.S. Mellish. Programming in Prolog. Springer-Verlag, 1981.

    Google Scholar 

  4. Cardelli L. & P. Wegner. On understanding Types, Data Abstraction and Polymorphism. Computing Surveys, Vol.17, No.4, December 1985, ACM, pp.471–522, 1986.

    Article  Google Scholar 

  5. Dayantis George. Logic program derivation for a class of first-order logic relations. In: Proc. 10th IJCAI, Vol.1, pp.9–15, 1987.

    Google Scholar 

  6. Dayantis George. ‘Types, modularisation and abstraction in logic programming'. D.Phil. thesis, University of Sussex, May 1988.

    Google Scholar 

  7. Domolki, B. & P. Szeredi. Prolog in practice. Information Processing (IFIP) '83, North-Holland, pp. 627–636, 1983.

    Google Scholar 

  8. Furukawa, K., Nakajima, R. & A. Yonezawa. Modularization and Abstraction in Logic Programming. ICOT TR-022, 1983.

    Google Scholar 

  9. Goguen, J. & J. Meseguer. Equalities, types and generic modules for logic programming. In: de Groot, D. & E. Lindstrom (eds.). Logic Programming: Functions, Relations and Equations. Prentice-Hall, 1986.

    Google Scholar 

  10. Miller, D.A. A theory of modules for logic programming. Proc. 3d IEEE Symposium on Logic Programming, pp.448–462, 1986.

    Google Scholar 

  11. Mishra, P. Towards a theory of types in Prolog. Proc. 1st IEEE Symposium on Logic Programming, pp.289–298, 1984.

    Google Scholar 

  12. Mycroft, A. & R. O'Keefe. A polymorphic type system for Prolog. D.A.I. paper, No.211, Univ. of Edinburgh, 1983. Also in: Artificial Intelligence, Vol.23, No.3, pp.295–307, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  13. Nait, Abdallah M. Procedures in Horn-clause programming. in: Shapiro, E. (ed.) Proceedings of Third International Conference on Logic Programming, London, July 1986, Lecture Notes in Computer Science, Vol. 225, Springer-Verlag, pp.433–447, 1986.

    Article  MATH  Google Scholar 

  14. O'Keefe, R. Towards an algebra for constructing logic programs. Proc. 2nd IEEE Symposium on Logic Programming, pp.152–160, 1985.

    Google Scholar 

  15. Sannella, D.T. & L.A. Wallen. A calculus for the construction of modular Prolog programs. (To appear:) Proc. 4th IEEE Symposium on Logic Programming, 1987.

    Google Scholar 

  16. Smolka, G. Order-sorted Horn logic, semantics and deduction. Technical paper, FB Informatik, Kaiserslautern Univ., W.Germany, 1986.

    Google Scholar 

  17. Walther, C. A many-sorted calculus based on resolution and paramodulation. Proc. 8th IJCAI, pp.882–891, 1983.

    Google Scholar 

  18. Zaniolo, C. Object-oriented programming in Prolog. Proc. 1st IEEE Symposium on Logic Programming, pp.265–270, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing, Imperial College, SW7 2AZ, London, UK

    George Dayantis

Authors
  1. George Dayantis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Grabowski P. Lescanne W. Wechler

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Akademie-Verlag Berlin

About this paper

Cite this paper

Dayantis, G. (1988). Types, modularisation and abstraction in logic programming. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-50667-5_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50667-6

  • Online ISBN: 978-3-540-46063-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation