Structural subtyping of non-recursive types is decidable

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 96-107

  Kuncak, Viktor ^a   Rinard, Martin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; SET THEORY; APPLICATION PROGRAMS; COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; CRYSTAL LATTICES; FORMAL LANGUAGES; LABORATORIES; LATTICE THEORY; LOGIC PROGRAMMING; RELIABILITY THEORY; SOFTWARE RELIABILITY;

STRUCTURAL SUBTYPING;

COMPUTER SCIENCE; C (PROGRAMMING LANGUAGE);

DECIDABLE THEORY; FIRST ORDER THEORIES; FUNCTION SYMBOLS; INFINITE DOMAINS; POWER SYSTEM RELIABILITY; QUANTIFIER ELIMINATION; RECURSIVE TYPES; TERM ALGEBRAS;

EID: 0042468049     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Information and Computation, 122, 1995.
2. A. Aiken, E. L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In Proc. 21st ACM POPL, pages 163-173, New York, NY, 1994.
3. H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. In Theoretical Computer Science, volume 122, pages 263-283, January 1994.
4. R. M. Amadio and L. Cardelli. Subtyping recursive types. Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
5. L. O. Andersen. Program Analysis and Specialization of the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
6. R. Backofen. A complete axiomatization of a theory with feature and arity constraints. Journal of Logic Programming, 24:37-72, 1995.
7. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 642-653, 1994.
8. W. Charatonik and A. Podelski. Set constraints with intersection. In Proc. 12th IEEE LICS, pages 362-372, 1997.
9. H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167-216, 1994.
10. H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7(3):371, 1989.
11. K. J. Compton and C. W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48(1):1-79, July 1990.
12. R. Davies and F. Pfenning. Intersection types and computational effects. In Proc. ICFP, pages 198-208, 2000.
13. S. Feferman and R. L. Vaught. The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47:57-103, 1959.
14. J. Ferrante and C. W. Rackoff. The Computational Complexity of Logical Theories, volume 718 of Lecture Notes in Mathematics. Springer-Verlag, 1979.
15. T. Freeman and F. Pfenning. Refinement types for ML. In Proc. ACM PLDI, 1991.
16. A. Frey. Satisfying subtype inequalities in polynomial space. Theoretical Computer Science, 277:105-117, 2002.
17. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proc. ACM PLDI, 2001.
18. F. Henglein and J. Rehof. The complexity of subtype entailment for simple types. In Proc. 12th IEEE LICS, pages 352-361, 1997.
19. M. Hoand and J. C. Mitchell. Lower bounds on type inference with subtypes. In Proc. 22rd ACM POPL, pages 176-185, 1995.
20. W. Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993.
21. T. Jim and J. Palsberg. Type inference in systems of recursive types with subtyping. http://www.cs.purdue.edu/homes/palsberg/, 1999.
22. M. Kerber and M. Kohlhase. A mechanization of strong Kleene logic for partial functions. In A. Bundy, editor, Proc. 12th CADE, pages 371-385, Nancy, France, 1994. Springer Verlag, Berlin, Germany. LNAI 814.
23. S. C. Kleene. Introduction to Metamathematics. D. Van Nostrand Company, Inc., Princeton, New Jersey, 1952. fifth reprint, 1967.
24. D. Kozen, J. Palsberg, and M. I. Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science, 5(1):113-125, 1995.
25. V. Kuncak and M. Rinard. On the theory of structural subtyping. Technical Report 879, Laboratory for Computer Science, Massachusetts Institute of Technology, http://www.mit.edu/̃vkuncak/papers/, 2003.
26. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
27. M. J. Maher. Complete axiomatizations of the algebras of the finite, rational, and infinite trees. Proc. 3rd IEEE LICS, 1988.
28. A. I. Mal'cev. The Metamathematics of Algebraic Systems, volume 66 of Studies in Logic and The Foundations of Mathematics. North Holland, 1971.
29. J. C. Mitchell. Type inference with simple types. Journal of Functional Programming, 1(3):245-285, 1991.
30. A. Mostowski. On direct products of theories. Journal of Symbolic Logic, 17(1):1-31, March 1952.
31. M. Mueller and J. Niehren. Ordering constraints over feature trees expressed in second-order monadic logic. Information and Computation, 159(1/2):22-58, 2000.
32. M. Mueller, J. Niehren, and R. Treinen. The first-order theory of ordering constraints over feature trees. Discrete Mathematics and Theoretical Computer Science, 4(2):193-234, September 2001.
33. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM (JACM), 27(2):356-364, 1980.
34. J. Palsberg and P. M. O'Keefe. A type system equivalent to flow analysis. Transactions on Programming Languages and Systems, 17(4):576-599, July 1995.
35. F. Pottier. Simplifying subtyping constraints: A theory. Information and Computation, 170(2):153-183, Nov. 2001.
36. M. Presburger. über die Vollständigkeit eines gewissen systems der aritmethik ganzer zahlen, in welchem die addition als einzige operation hervortritt. In Comptes Rendus du premier Congrès des Mathématiciens des Pays slaves, Warsawa, pages 92-101, 1929.
37. W. C. Rounds. Feature logics. In J. v. Benthem and A. ter Meulen, editors, Handbook of Logic and Language. Elsevier, 1997.
38. T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Transactions on Computational Logic (TOCL), 2(2):155-181, 2001.
39. V. Simonet. Type inference with structural subtyping: A faithful formalization of an efficient constraint solver. Submitted for publication, Mar. 2003.
40. T. Skolem. Untersuchungen über die Axiome des Klassenkalküls and über "Produktations- und Summationsprobleme", welche gewisse Klassen von Aussagen betreffen. Skrifter utgit av Vidnskapsselskapet i Kristiania, I. klasse, no. 3, Oslo, 1919.
41. T. Sturm and V. Weispfenning. Quantifier elimination in term algebras: The case of finite languages. In V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, editors, Computer Algebra in Scientific Computing (CASC), TUM Muenchen, 2002.
42. Z. Su, A. Aiken, J. Niehren, T. Priesnitz, and R. Treinen, First-order theory of subtyping constraints. In Proc. 29th ACM POPL, 2002.
43. A. Tarski. Arithmetical classes and types of algebraically closed and real-closed fields. Bull. Amer. Math. Soc., 55, 64, 1192, 1949.
44. A. Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949.
45. J. Tiuryn. Subtype inequalities. In Proc. 7th IEEE LICS, 1992.
46. R. Treinen. Feature trees over arbitrary structures. In P. Blackburn and M. de Rijke, editors, Specifying Syntactic Structures, chapter 7, pages 185-211. CSLI Publications and FoLLI, 1997.
47. V. Trifonov and S. Smith. Subtyping constrained types. In Proc. 3rd International Static Analysis Symposium, volume 1145 of Lecture Notes in Computer Science, 1996.
48. I. Walukiewicz. Monadic second-order logic on tree-like structures. Theoretical Computer Science, 275(1-2):311-346, Mar. 2002.
49. M. Wand, P. M. O'Keefe, and J. Palsberg. Strong normalization with non-structural subtyping. Mathematical Structures in Computer Science, 5(3):419-430, 1995.