Typing constraint logic programs

Theory and Practice of Logic Programming

Volumn 1, Issue 6, 2001, Pages 751-777

  Fages, François ^a   Coquery, Emmanuel ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

Constraint logic programming; Metaprogramming; Prolog; subtyping; type systems

Indexed keywords

EID: 85008521166     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001120     Document Type: Article

References (29)

1. Ait-Kaci, H. and Nasr, R. (1986) Login: A logical programming language with built-in inheritance. Journal of Logic Programming, 3 : 187–215.
2. Ait-Kaci, H., Podelski, A. and Goldstein, K. (1997) Order-sorted feature theory unification. Journal of Logic Programming, 30 (2): 100–124.
3. Amadio, R. M. and Cardelli, L. (1993) Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15 (4): 575–631.
4. Beierle, C. (1995) Type inferencing for polymorphic order-sorted logic programs. 12th International Conference on Logic Programming ICLP'95, pp. 765–779. MIT Press.
5. Colmerauer, A. (1984) Equations and inequalitions on finite and infinite trees. Proc. International Conference on Fifth Generation Computer Systems FGCS'84, pp. 85–99.
6. Colmerauer, A. (1985) Prolog in 10 figures. Communications of the ACM, 28 (12): 1296–1310.
7. Colmerauer, A. (1996) Specification of Prolog IV. LIM Technical Report.
8. Coquery, E. (2000) Tclp: a generic type checker for constraint logic programs. http://pauillac.inria.fr/~coquery/tclp/.
9. Demoen, B., de la B anda, M. G. and Stuckey, P. J. (1999) Type constraint solving for parametric and ad-hoc polymorphism. Proceedings 22nd Australian Computer Science Conference, pp. 217–228.
10. Dietrich, R. and Hagl, F. (1988) A polymorphic type system with subtypes for Prolog. In: Ganzinger, H. (editor), Proceedings European Symposium on Programming ESOP'88, pp. 79–93. Springer-Verlag.
11. Fages, F. and Paltrinieri, M. (1997) A generic type system for CLP(X). Technical report, Ecole Normale Supérieure LIENS 97–16.
12. Frey, A. (1997) Satisfying subtype inequalities in polynomial space. Proceedings International Static Analysis Aymposium SAS'97: LNCS 1302. Springer-Verlag.
13. Fuh, Y. C. and Mishra, P. (1988) Type inference with subtypes. Proc. ESOP'88: LNCS 300, pp. 94–114. Springer-Verlag.
14. Hanus, M. (1992) Logic programming with type specifications. In: Pfenning, F. (editor), Types in Logic Programming, pp. 91–140. MIT Press.
15. Hill, P. and Lloyd, J. (1994) The Gödel Programming Language. MIT Press.
16. Hill, P. M. and Topor, R. W. (1992) A semantics for typed logic programs. MIT Press. In: Pfenning, F. (editor), Types in Logic Programming, pp. 1–61. MIT Press.
17. Jaffar, J. and Lassez, J. L. (1987) Constraint logic programming. Proceedings Symposium on Principles of Programming Languages POPL 87, pp. 111–119.
18. Kfoury, A. J., Tiruyn, J. and Urzyczyn, P. (1989) The undecidability of the semi-unification problem. Technical report, BUCS-89–010, Boston University.
19. Lakshman, T. K. and Reddy, U. S. (1991) Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. In: Saraswat, V. and Ueda, K. (editors), Proceedings International Symposium on Logic Programming, pp. 202–217. MIT Press.
20. Meyer, G. (1996) Type checking and type inferencing for logic programs with subtypes and parametric polymorphism. Technical report, Informatik Berichte 200, Fern Universitat Hagen.
21. Mycroft, A. and O'Keefe, R. A. (1984) A polymorphic type system for Prolog. Artificial intelligence, 23 : 295–307.
22. Pottier, F. (2000a) Simplifying subtyping constraints: a theory. Information & Computation (to appear).
23. Pottier, F. (2000b) Wallace: an efficient implementation of type inference with subtyping. http://pauillac.inria.fr/~fpottier/wallace/.
24. Smaus, J. G., Fages, F. and Deransart, P. (2000) Using modes to ensure subject reduction for typed logic programs with subtyping. Proceedings Foundations of Software Technology and Theoretical Computer Science FSTTCS'2000: LNCS 1974, pp. 214–226. Springer-Verlag.
25. Smolka, G. (1988) Logic programming with polymorphically order-sorted types. Algebraic and Logic Programming ALP’88: LNCS 343, pp. 53–70. Springer-Verlag.
26. Smolka, G. (1989) Logic programming over polymorphically order-sorted types. PhD thesis, Universitat Kaiserslautern.
27. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1–3): 17–64.
28. Tiuryn, J. (1992) Subtype inequalities. Proc. 7th IEEE Symposium on Logic in Computer Science LICS’92, pp. 308–315.
29. Yardeni, E., Frühwirth, T. and Shapiro, E. (1992) Polymorphically typed logic programs. MIT Press. In: Pfenning, F (editor), Types in Logic Programming, pp. 63–90. MIT Press.