Subtyping constraints in quasi-lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2914, Issue , 2003, Pages 136-148

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

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; LOGIC PROGRAMMING; PROBLEM ORIENTED LANGUAGES; SOFTWARE ENGINEERING;

CONSTRAINT LOGIC PROGRAMMING; EXPLICIT SOLUTIONS; FUNCTIONAL LANGUAGES; NON-STRUCTURAL; NP-COMPLETENESS; S-ALGORITHMS; SATISFIABILITY PROBLEMS; TYPE INFERENCES;

FUNCTIONAL PROGRAMMING;

EID: 35248832117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_12     Document Type: Article

References (14)

1. Martín Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag, 1996.
2. ∼coquery/tclp/.
3. E. Coquery and F. Fages. From typing constraints to typed constraint systems in CHR. In Third workshop on Rule-based Constraint Reasoning and Programming, CP'01, Cyprus, December 2001.
4. E. Coquery and F. Fages. Tclp: overloading, subtyping and parametric polymorphism made practical for constraint logic programming. Technical report, INRIA Rocquencourt, 2002.
5. E. Coquery and F. Fages. Subtyping constraints in quasi-lattices. Technical report, INRIA Rocquencourt, September 2003.
6. F. Fages and E. Coquery. Typing constraint logic programs. Theory and Practice of Logic Programming, 1, November 2001.
7. A. Frey. Satisfying subtype inequalities in polynomial space. In Proceedings of the 1997 International Static Analysis Symposium, number 1302 in LNCS, 1997.
8. Th. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming, 37(1-3):95-138, October 1998.
9. J. Palsberg, T. Zhao, and T. Jim. Automatic discovery of covariant read-only fields. In Ninth International Workshop on Foundations of Object-Oriented Languages, January 2002.
10. F. Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4):312-347, November 2000.
11. F. Pottier. Simplifying subtyping constraints: a theory. Information & Computation, 170(2):153-183, November 2001.
12. Vaughan Pratt and Jerzy Tiuryn. Satisfiability of inequalities in a poset. Fundamenta Informaticae, 28(1-2):165-182, 1996.
13. G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, Universitat Kaiserslautern, 1989.
14. V. Trifonov and S. Smith. Subtyping constrained types. In Proc. 3rd Int'l Symposium on Static Analysis, number 1145 in LNCS, pages 349-365. Springer, 1996.