The first-order theory of subtyping constraints

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 203-216

  Su, Zhendong ^a   Aiken, Alexander ^a   Niehren, Joachim ^b   Priesnitz, Tim ^b   Treinen, Ralf ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAARLAND UNIVERSITY   (Germany)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; CONSTRAINT THEORY; DECISION THEORY; OBJECT ORIENTED PROGRAMMING;

FIRST ORDER THEORY; PROGRAM ANALYSIS; SUBTYPING CONSTRAINTS; TREE AUTOMATA;

PROGRAMMING THEORY;

EID: 0036041647     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503292     Document Type: Conference Paper

References (44)

1. Type inclusion constraints and type inference
2. Soft typing with conditional types
3. Optimal representations of polymorphic types with subtyping
4. Subtyping recursive types
5. Diophantine equations, presburger arithmetic and finite automata
6. Weak second order logic and finite automata
7. Solving symbolic ordering constraints
8. Tree automata techniques and applications
9. Ordering constraints on trees
10. The first-order theory of lexicographic path orderings is undecidable
11. Making set-constraint based program analyses scale
12. Componential set-based analysis
13. Catching bugs in the web of program invariants
14. Set based analysis of ML programs
15. The complexity of subtype entailment for simple types
16. Constraint automata and the complexity of recursive subtype entailment
17. Efficient recursive subtyping
18. Efficient inference of partial types
19. Complete axiomatizations of the algebras of the finite, rational and infinite trees
20. A practical subtyping system for erlang
21. A theory of type polymorphism in programming
22. Type inference with simple types
23. The first-order theory of ordering constraints over feature trees
24. Entailment of atomic set constraints is PSPACE-complete
25. Entailment of non-structural subtype constraints
26. Non-structural subtype entailment in automata theory
27. Pizza into Java: Translating theory into practice
28. A type system equivalent to flow analysis
29. Object-oriented type inference
30. A variant of a recursively unsolvable problem
31. Simplifying subtyping constraints
32. Simplifying subtyping constraints: A theory
33. Decidability of second-order theories and automata on infinite trees
34. Control flow analysis in scheme
35. Points-to analysis in almost linear time
36. Entailment with conditional equality constraints
37. A new method for undecidability proofs of first order theories
38. Predicate logic and tree automata with tests
39. Subtyping constrained types
40. Decidability of the purely existential fragment of the theory of term algebras
41. An automata-theoretic approach to presburger arithmetic constraints