Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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.
A. Colmerauer, H. Kanoui, and M. Van Caneghem, Prolog, Theoretical Principles and Current Trends. Technology and Science of Informatics 2,4, 1983, 255–292.
A. Colmerauer, Equations and Inequations on Finite and Infinite Trees. Proc. of the 2nd International Conference on Fifth Generation Computer Systems, 1984, 85–99.
R. Dietrich, A Polymorphic Type System with Subtypes for Prolog. Proc. of the 2nd European Symposium on Programming, Nancy, France, Springer LNCS 300, 1988.
H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. Springer Verlag, 1985.
K. Futatsugi, J.A. Goguen, J.-P. Jouannaud and J. Meseguer, Principles of OBJ2. Proc. POPL 1985, 52–66.
J.A. Goguen, Order Sorted Algebra. Semantics and Theory of Computation Report No. 14, UCLA Computer Science Department, 1978.
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.
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.
J.A. Goguen and J. Meseguer, Models and Equality for Logic Programming. TAPSOFT '87, Pisa, Springer LNCS 250, 1987, 1–22.
R. Harper, D. MacQueen, and R. Milner, Standard ML. Report ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, 1986.
M. Höhfeld and G. Smolka, Logic Programming with Feature Terms. Forthcoming SEKI Report, Universität Kaiserslautern, West Germany, 1988.
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.
J. Jaffar and J.-L. Lassez, Constraint Logic Programming. Proc. of the 14th ACM Symposium on Principles of Programming Languages, Munich, 1987, 111–119.
J.W. Lloyd, Foundations of Logic Programming. Springer Verlag, 1984.
A. Martelli and U. Montanari, An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems 4,2, 1982, 258–282.
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.
R. Milner, A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17, 1978, 348–375.
P. Mishra, Towards a Theory of Types in Prolog. Proc. of the 1st IEEE Symposium on Logic Programming, 1984, 289–298.
K. Mukai, Anadic Tuples in Prolog. Technical Report TR-239, ICOT, Tokyo, 1987.
A. Mycroft and R.A. O'Keefe, A Polymorphic Type System for Prolog. Artificial Intelligence 23, 1984, 295–307.
G. Smolka, TEL (Version 0.9), Report and User Manual. SEKI Report SR-87-11, FB Informatik, Universität Kaiserslautern, West Germany, 1988a.
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.
G. Smolka, Logic Computation with Polymorphically Order-Sorted Types. Dissertation, FB Informatik, Universität Kaiserslautern, West Germany, 1988c.
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.
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.
C. Walther, A Many-Sorted Calculus Based on Resolution and Paramodulation. Proc. 8th International Joint Conference on Artificial Intelligence, 1983, W. Kaufmann, 882–891.
C. Walther, A Many-sorted Calculus Based on Resolution and Paramodulation. Pitman and Morgan Kaufman Publishers, Research Notes in Artificial Intelligence, 1987.
C. Walther, Many-Sorted Unification. Journal of the ACM 35 (1), 1988, 1–17.
J. Zobel, Derivation of Polymorphic Types for Prolog Programs. Proc. of the 4th International Conference on Logic Programming, Melbourne, Australia, 1987, 817–838.
Author information
Authors and Affiliations
Editor information
Rights 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