Decidability of type-checking in the Calculus of Algebraic Constructions with Size annotations

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 135-150

  Blanqui, Frédéric ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; PROBABILITY; PROBLEM SOLVING; TECHNICAL WRITING;

CALCULUS OF ALGEBRAIC CONSTRUCTIONS; FIRST-ORDER REWRITING; SIMPLY TYPED & LAMBDA; USER DEFINED REWRITE RULES;

COMPUTABILITY AND DECIDABILITY;

EID: 26944450037     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_11     Document Type: Conference Paper

References (30)

1. A. Abel. Termination checking with types. Theoretical Informatics and Applications, 38(4):277-319, 2004.
2. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
3. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Mathematical Structures in Computer Science, 14(1):97-141, 2004.
4. G. Barthe, B. Grégoire, and F. Pastawski. Practical inference for type-based termination in a polymorphic setting. In Proc. of TLCA'05, LNCS 3461.
5. F. Blanqui. Rewriting modulo in Deduction modulo. In Proc. of RTA'03, LNCS 2706.
6. F. Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. In Proc. of RTA'04, LNCS 3091.
7. F. Blanqui. Full version of [6]. See http://www.loria.fr/~blanqui/.
8. F. Blanqui. Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science, 15(1):37-92, 2005.
9. F. Blanqui. Full version. See http://www.loria.fr/~blanqui/.
10. F. Blanqui. Inductive types in the Calculus of Algebraic Constructions. Fundamenta Informaticae, 65(1-2):61-86, 2005.
11. V. Breazu-Tannen. Combining algebra and higher-order types. In Proc. of LICS'88.
12. G. Chen. Subtyping, Type Conversion and Transitivity Elimination. PhD thesis, Université Paris VII, France, 1998.
13. W. N. Chin and S. C. Khoo. Calculating sized types. Journal of Higher-Order and Symbolic Computation, 14(2-3):261-300, 2001.
14. Coq-Development-Team. The Coq Proof Assistant Reference Manual - Version 8.0. INRIA Rocquencourt, France, 2004. http://coq.inria.fr/.
15. T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, ed., Logical Frameworks, p 255-279. Cambridge University Press, 1991.
16. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2-3):95-120, 1988.
17. T. Coquand and C. Paulin-Mohring. Inductively defined types. In Proc. of COLOG'88, LNCS 417.
18. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol B, ch 6. North-Holland, 1990.
19. E. Giménez. Structural recursive definitions in type theory. In Proc. of ICALP'98, LNCS 1443.
20. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proc. of POPL'96.
21. J.-P. Jouannaud and A. Rubio. The Higher-Order Recursive Path Ordering. In Proc. of LICS'99.
22. G. Lueker, N. Megiddo, and V. Ramachandran. Linear programming with two variables per inequality in poly-log time. SIAM Journal on Computing, 19(6): 1000-1010, 1990.
23. F. Müller. Confluence of the lambda calculus with left-linear algebraic rewriting. Information Processing Letters, 41(6):293-299, 1992.
24. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
25. V. Pratt. Two easy theories whose combination is hard. Technical report, MIT, United States, 1977.
26. M. Sulzmann. A general type inference framework for Hindley/Milner style systems. In Proc. of FLOPS'01, LNCS 2024.
27. D. Walukiewicz-Chrza̧szcz. Termination of rewriting in the Calculus of Constructions. Journal of Functional Programming, 13(2):339-414, 2003.
28. H. Xi. Dependent types in practical programming. PhD thesis, Carnegie-Mellon, Pittsburgh, United States, 1998.
29. H. Xi. Dependent types for program termination verification. Journal of Higher-Order and Symbolic Computation, 15(1):91-131, 2002.
30. C. Zenger. Indexed types. Theoretical Computer Science, 187(1-2):147-165, 1997.