Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Logic programming with polymorphically order-sorted types

  • Invited 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:

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.

References

  • H. Aït-Kaci and R. Nasr, LOGIN: A Logic Programming Language with Built-In Inheritance. The Journal of Logic Programming, 1986, 3, 185–215.

    Article  MATH  Google Scholar 

  • A. Colmerauer, H. Kanoui, and M. Van Caneghem, Prolog, Theoretical Principles and Current Trends. Technology and Science of Informatics 2,4, 1983, 255–292.

    MATH  Google Scholar 

  • A. Colmerauer, Equations and Inequations on Finite and Infinite Trees. Proc. of the 2nd International Conference on Fifth Generation Computer Systems, 1984, 85–99.

    Google Scholar 

  • R. Dietrich, A Polymorphic Type System with Subtypes for Prolog. Proc. of the 2nd European Symposium on Programming, Nancy, France, Springer LNCS 300, 1988.

    Google Scholar 

  • H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. Springer Verlag, 1985.

    Google Scholar 

  • K. Futatsugi, J.A. Goguen, J.-P. Jouannaud and J. Meseguer, Principles of OBJ2. Proc. POPL 1985, 52–66.

    Google Scholar 

  • J.A. Goguen, Order Sorted Algebra. Semantics and Theory of Computation Report No. 14, UCLA Computer Science Department, 1978.

    Google Scholar 

  • J.A. Goguen, J.W. Thatcher, and E.G. Wagner, An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. In R.T. Yeh (ed.), Current Trends in Programming Methodology, Volume IV, Data Structuring; Prentice Hall, 1978, 80–149.

    Google Scholar 

  • J.A. Goguen and J. Meseguer, Eqlog: Equality, Types, and Generic Modules for Logic Programming. In D. DeGroot and G. Lindstrom (eds.), Logic Programming, Functions, Relations, and Equations; Prentice Hall 1986.

    Google Scholar 

  • J.A. Goguen and J. Meseguer, Models and Equality for Logic Programming. TAPSOFT '87, Pisa, Springer LNCS 250, 1987, 1–22.

    MathSciNet  MATH  Google Scholar 

  • R. Harper, D. MacQueen, and R. Milner, Standard ML. Report ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, 1986.

    Google Scholar 

  • M. Höhfeld and G. Smolka, Logic Programming with Feature Terms. Forthcoming SEKI Report, Universität Kaiserslautern, West Germany, 1988.

    Google Scholar 

  • M. Huber and I. Varsek, Extended Prolog for Order-Sorted Resolution. Proc. of the 4th IEEE Symposium on Logic Programming, San Francisco, 1987, 34–45.

    Google Scholar 

  • J. Jaffar and J.-L. Lassez, Constraint Logic Programming. Proc. of the 14th ACM Symposium on Principles of Programming Languages, Munich, 1987, 111–119.

    Google Scholar 

  • J.W. Lloyd, Foundations of Logic Programming. Springer Verlag, 1984.

    Google Scholar 

  • A. Martelli and U. Montanari, An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems 4,2, 1982, 258–282.

    Article  MATH  Google Scholar 

  • J. Meseguer, J.A. Goguen, and G. Smolka, Order-Sorted Unification. Report CSLI-87-86, Center for the Study of Language and Information, Stanford University, 1987. To appear in Symbolic Computation, Special Issue on Unification.

    Google Scholar 

  • R. Milner, A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17, 1978, 348–375.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Mishra, Towards a Theory of Types in Prolog. Proc. of the 1st IEEE Symposium on Logic Programming, 1984, 289–298.

    Google Scholar 

  • K. Mukai, Anadic Tuples in Prolog. Technical Report TR-239, ICOT, Tokyo, 1987.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • G. Smolka, TEL (Version 0.9), Report and User Manual. SEKI Report SR-87-11, FB Informatik, Universität Kaiserslautern, West Germany, 1988a.

    Google Scholar 

  • G. Smolka, A Feature Logic with Subsorts. LILOG Report 33, IBM Deutschland, West Germany May 1988. Presented at the Workshop on Unification Formalisms—Syntax, Semantics and Implementation, Titisee, West Germany, April 1988b.

    Google Scholar 

  • G. Smolka, Logic Computation with Polymorphically Order-Sorted Types. Dissertation, FB Informatik, Universität Kaiserslautern, West Germany, 1988c.

    MATH  Google Scholar 

  • G. Smolka and H. Aït-Kaci, Inheritance Hierarchies: Semantics and Unification. MCC Report AI-057-87, MCC, Austin, Texas, 1987. To appear in Symbolic Computation, Special Issue on Unification.

    MATH  Google Scholar 

  • G. Smolka, W. Nutt, J.A. Goguen and J. Meseguer, Order-Sorted Equational Computation. SEKI Report SR-87-14, Universität Kaiserslautern, West Germany, 1987. To appear in H. Aït-Kaci and M. Nivat, Resolution of Equations in Algebraic Structures, Academic Press.

    Google Scholar 

  • C. Walther, A Many-Sorted Calculus Based on Resolution and Paramodulation. Proc. 8th International Joint Conference on Artificial Intelligence, 1983, W. Kaufmann, 882–891.

    Google Scholar 

  • C. Walther, A Many-sorted Calculus Based on Resolution and Paramodulation. Pitman and Morgan Kaufman Publishers, Research Notes in Artificial Intelligence, 1987.

    Google Scholar 

  • C. Walther, Many-Sorted Unification. Journal of the ACM 35 (1), 1988, 1–17.

    Article  MathSciNet  Google Scholar 

  • J. Zobel, Derivation of Polymorphic Types for Prolog Programs. Proc. of the 4th International Conference on Logic Programming, Melbourne, Australia, 1987, 817–838.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. WT LILOG, IBM Deutschland, 7000, Stuttgart 80, West Germany

    Gert Smolka

Authors
  1. Gert Smolka
    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

Smolka, G. (1988). Logic programming with polymorphically order-sorted types. 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_58

Download citation

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

  • 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