Order-sorted feature theory unification

Journal of Logic Programming

Volumn 30, Issue 2, 1997, Pages 99-124

  Aït Kaci, Hassan ^a   Podelski, Andreas ^b   Goldstein, Seth Copen ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; SORTING;

CONFLUENT NORMALIZATION RULES; NORMALIZATION STRATEGY; ORDER SORTED FEATURE (OSF) THEORY; SORT DEFINITIONS; VARIABLE EQUATION; VARIABLE SORTING;

PROGRAMMING THEORY;

EID: 0031076919     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00053-2     Document Type: Article

References (21)

1. Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. Aït-Kaci, H., A Lattice-Theoretic Approach to Computation Based on a Calculus of Partially-Ordered Type Structures, Ph.D. Thesis, Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 1984.
3. Aït-Kaci, H., An Algebraic Semantics Approach to the Effective Resolution of Type Equations, Theoretical Computer Science 45:293-351 (1986).
4. Aït-Kaci, H., An Introduction to LIFE - Programming with Logic, Inheritance, Functions, and Equations, in: D. Miller (ed.), Proc. Int. Symp. on Logic Programming, MIT Press, Cambridge, MA, Oct. 1993, pp. 52-68.
5. Aït-Kaci, H. and Nasr, R., LOGIN: A Logic Programming Language with Built-in Inheritance, J. Logic Programming 3:185-215 (1986).
6. Aït-Kaci, H. and Podelski, A., Towards a Meaning of LIFE, J. Logic Programming 16(3-4):195-234 (1993).
7. Aït-Kaci, H. and Podelski, A., Functions as Passive Constraints in LIFE, ACM Trans. Programming Languages and Systems 16(4):1279-1318 (1994).
8. Aït-Kaci, H., Podelski, A., and Copen Goldstein, S., Order-Sorted Feature Theory Unification, PRL Research Report 32, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Malmaison, France, May 1993.
9. Aït-Kaci, H., Podelski, A., and Goldstein, S. C., Order-Sorted Feature Theory Unification, in: D. Miller (ed.), Proc. Int. Symp. on Logic Programming, MIT Press, Cambridge, MA, Oct. 1993, pp. 506-524.
10. Aït-Kaci, H. and Vorbeck, M., Compiling Order-Sorted Feature Theory Unification, Research Report Draft, Intelligent Software Group, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, Feb. 1996.
11. Cardelli, L., A Semantics of Multiple Inheritance, Information and Computation 76:138-164 (1988).
12. Carpenter, B., Typed Feature Structures: A Generalization of First-Order Terms, in: V. Saraswat and K. Ueda (eds.), Proc. 1991 Int. Symp. on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 187-201.
13. Carpenter, B., The Logic of Typed Feature Structures, Vol. 32 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, England, 1992.
14. Chang, C. C. and Keisler, H. J., Model Theory, Vol. 73 of Studies in Logic and the Foundations of Mathematics, 3rd edition, North-Holland, Amsterdam, The Netherlands, 1990.
15. Emele, M. C., Unification with Lazy Non-Redundant Copying, in: Proc. 29th Annual Meeting of the ACL, Association for Computational Linguistics, Berkeley, CA, June 1991.
16. Emele, M. C. and Zajac, R., Typed Unification Grammars, in: Proc. 13th Int. Conf. on Computational Linguistics (CoLing90), Helsinki, Finland, Aug. 1990.
17. Garrigue, J. and Aït-Kaci, H., The Typed Polymorphic Label-Selective λ-Calculus, in: Proc. 21st ACM Symp. on Principles of Programming Languages, Jan. 1994, pp. 35-47.
18. Manna, Z., Mathematical Theory of Computation, McGraw-Hill Computer Science Series, McGraw-Hill, New York, 1974.
19. Rémy, D., Type Inference for Records in a Natural Extension of ML, Technical Report 1431, INRIA, Rocquencourt, France, May 1991.
20. Smolka, G., Feature Constraint Logic for Unification Grammar, J. Logic Programming 12:51-87 (1992).
21. Wand, M., Type Inference for Record Concatenation and Multiple Inheritance, in: Proc. 4th Annual Symp. on Logic in Computer Science, 1989, pp. 92-97.