Semi-continuous sized types and termination

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

Volumn 4207 LNCS, Issue , 2006, Pages 72-88

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; RECURSIVE FUNCTIONS; SEMANTICS; SYNTACTICS;

ADMISSIBLE FUNCTIONS; DATA TYPES; POLYMORPHISM; RECURSIVE CALLS;

DATA STRUCTURES;

EID: 33750353274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_5     Document Type: Conference Paper

References (19)

1. Abel, A.: Termination and guardedness checking with continuous types. In: Hofmann, M., ed., Typed Lambda Calculi and Applications (TLCA 2003), Valencia, Spain, volume 2701 of Lecture Notes in Computer Science. Springer-Verlag (2003), 1-15
2. Abel, A.: Termination checking with types. RAIRO - Theoretical Informatics and Applications 38 (2004) 277-319. Special Issue: Fixed Points in Computer Science (FICS'03)
3. Abel, A.: Polarized subtyping for sized types. In: Grigoriev, D., Harrison, J., Hirsch, E. A., eds., Computer Science Symposium in Russia (CSR 2006), St. Petersburg, June 8-12, 2006, volume 3967 of Lecture Notes in Computer Science. Springer-Verlag (2006), 381-392
4. Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. Ph.D. thesis, Ludwig-Maximilians-Universität München (2006)
5. Abel, A., Matthes, R.: Fixed points of type constructors and primitive recursion. In: Marcinkowski, J., Tarlecki, A., eds., Computer Science Logic, CSL'04, volume 3210 of Lecture Notes in Computer Science. Springer-Verlag (2004), 190-204
6. Amadio, R. M., Coupet-Grimal, S.: Analysis of a guard condition in type theory. In: Nivat, M., ed., Foundations of Software Science and Computation Structures, First International Conference, FoSSaCS'98, volume 1378 of Lecture Notes in Computer Science. Springer-Verlag (1998), 48-62
7. Barthe, G., Frade, M. J., Giménez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Mathematical Structures in Computer Science 14 (2004) 1-45
8. Barthe, G., Grégoire, B., Pastawski, F.: Practical inference for type-based termination in a polymorphic setting. In: Urzyczyn, P., ed., Typed Lambda Calculi and Applications (TLCA 2005), Nara, Japan, volume 3461 of Lecture Notes in Computer Science. Springer-Verlag (2005), 71-85
9. Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In: van Oostrom, V., ed., Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, volume 3091 of Lecture Notes in Computer Science. Springer-Verlag (2004), 24-39
10. Blanqui, F.: Decidability of type-checking in the Calculus of Algebraic Constructions with size annotations. In: Ong, C.-H. L., ed., Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, volume 3634 of Lecture Notes in Computer Science. Springer-Verlag (2005), 135-150
11. Crary, K., Weirich, S.: Flexible type analysis. In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, volume 34 of SIGPLAN Notices. ACM Press (1999), 233-248
12. Duggan, D., Compagnoni, A.: Subtyping for object type constructors (1999). Presented at FOOL 6
13. Giménez, E.: Structural recursive definitions in type theory. In: Larsen, K. G., Skyum, S., Winskel, G., eds., Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, volume 1443 of Lecture Notes in Computer Science. Springer-Verlag (1998), 397-408
14. Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: 23rd Symposium on Principles of Programming Languages, POPL'96 (1996), 410-423
15. Mendler, N. P.: Recursive types and type constraints in second-order lambda calculus. In: Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, Ithaca, N.Y. IEEE Computer Society Press (1987), 30-36
16. Pareto, L.: Types for Crash Prevention. Ph.D. thesis, Chalmers University of Technology (2000)
17. Paulin-Mohring, C.: Inductive definitions in the system Coq - rules and properties. Technical report, Laboratoire de l'Informatique du Parallélisme (1992)
18. Steffen, M.: Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakultät, Universität Erlangen (1998)
19. Xi, H.: Dependent types for program termination verification. In: Proceedings of 16th IEEE Symposium on Logic in Computer Science. Boston, USA (2001)