Skip to main content
SpringerLink
Log in

Logic programs with polymorphic types: A condition for static type checking

  • Applications to Logic Programming, Normalization Strategies and Unification
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1992)

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

Included in the following conference series:

  • 153 Accesses

Abstract

This paper describes a polymorphic type system for logic programs. Well-typedness is defined on so-called execution modules of the program, which is shown to yield better results than [7] in many cases. The system is partly implemented.

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.

References

  1. Bonnier, S. A Formal Basis for Horn Clause Logic with External Polymorphic Functions Dissertation, 1992, Linköping University

    Google Scholar 

  2. Bonnier, S. and Maluszyński, J. Towards a Clean Amalgamation of Logic Programs with External Procedures In: Kowalski, R. A. and Bowen, K. A. (eds.) Proceedings of 5th International Conference and Symposium of Logic Programming 1988

    Google Scholar 

  3. Boye, J. S-SLD-resolution — An Operational Semantics for Logic Programs with External Procedures In: Maluszyńsky, J. and Wirsing, M. (eds.) Proceedings of 3rd International Symposium on Programming Language Implementation and Logic Programming 1991

    Google Scholar 

  4. Hanus, M. Horn clause programs with polymorphic types: semantics and resolution Theoretical Computer Science 89(1991), pp 63–106

    Google Scholar 

  5. Kluźniak, F. and Kågedal, A. Enriching Prolog with S-Unification In: Darlington, J. and Dietrich, R. (eds.) Proceedings of PHOENIX Seminar & Workshop on Declarative Programming 1991

    Google Scholar 

  6. Lloyd, J. W. Foundations of Logic Programming, 2nd ed. Springer-Verlag 1987, ISBN 3-540-18199-7

    Google Scholar 

  7. Mycroft, A. and O'Keefe, R. A. A Polymorphic Type System for Prolog Artificial Intelligence 23(1984), pp 295–307

    MathSciNet  Google Scholar 

  8. Nilsson, U. Systematic Semantic Approximations of Logic Programs In: Deransart, P. and Maluszynski, J. (eds.) Proceedings of International Workshop on Programming Language Implementation and Logic Programming 1990

    Google Scholar 

  9. Pfennig, F. Tutorial on Types in Logic Programming Given at the 7th International Conference on Logic Programming 1990

    Google Scholar 

  10. Wallgren, J. Licentiate thesis, To appear (1992), Linköping University (On types and logic programming — No preliminary title yet)

    Google Scholar 

Download references

Author information

Author notes

  1. Staffan Bonnier

    Present address: École Normale Supérieure, Paris, France

Authors and Affiliations

  1. Department of Computer and Information Science, Linköping University, S-581 83, Linköping

    Staffan Bonnier & Jonas Wallgren

Authors
  1. Staffan Bonnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonas Wallgren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Staffan Bonnier .

Editor information

Michaël Rusinowitch Jean-Luc Rémy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonnier, S., Wallgren, J. (1993). Logic programs with polymorphic types: A condition for static type checking. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-56393-8_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56393-8

  • Online ISBN: 978-3-540-47549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation