Mixed inductive/coinductive types and strong normalization

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

Volumn 4807 LNCS, Issue , 2007, Pages 286-301

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS;

CORECURSIVE FUNCTIONS; MENDLER (CO)ITERATION; SATURATED SETS;

SET THEORY;

EID: 38149137419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76637-7_19     Document Type: Conference Paper

References (17)

1. Abel, A.: Polarized subtyping for sized types. In: Grigoriev, D., Harrison, J., Hirsch, EA. (eds.) CSR 2006. LNCS, vol. 3967, pp. 381-392. Springer, Heidelberg (2006)
2. Abel, A.: Semi-continuous sized types and termination. In: Esik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 72-88. Springer, Heidelberg (2006)
3. Abel, A.: Towards generic programming with sized types. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 10-28. Springer, Heidelberg (2006)
4. Abel, A.: Strong normalization and equi-(co)inductive types. In: Ronchi Della Rocca, S. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 8-22. Springer, Heidelberg (2007)
5. Abel, A., Matthes, R., Uustalu, T.: Iteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. 333, 3-66 (2005)
6. Amadio, R.M., Coupet-Grimal, S.: Analysis of a guard condition in type theory (extended abstract). In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 48-62. Springer, Heidelberg (1998)
7. Barthe, G., Frade, M.J., Giménez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Math. Struct, in Comput. Sci. 14, 1-45 (2004)
8. Barthe, G., Grégoire, B., Pastawski, F.: CIC: Type-based termination of recursive definitions in the Calculus of Inductive Constructions. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 257-271. Springer, Heidelberg (2006)
9. Blanqui, F., Riba, C.: Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 105-119. Springer, Heidelberg (2006)
10. Ghani, N., Hancock, P., Pattinson, D.: Continuous functions on final coalgebras. Electr. Notes in Theor. Comp. Sci. 164, 141-155 (2006)
11. Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: POPL 1996, pp. 410-423 (1996)
12. Mendler, N.P.: Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic 51, 159-172 (1991)
13. Parigot, M.: Recursive programming with proofs. Theor. Comput. Sci. 94, 335-356 (1992)
14. Parigot, M.: Proofs of strong normalization for second order classical natural deduction. The Journal of Symbolic Logic 62, 1461-1479 (1997)
15. Raffalli, C.: Data types, infinity and equality in system AF2. In: Meinke, K., Borger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 280-294. Springer, Heidelberg (1994)
16. Riba, C.: On the stability by union of reducibility candidates. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 317-331. Springer, Heidelberg (2007)
17. Swierstra, W.: I/O in a dependently typed programming language. Talk presented at TYPES 2007 (2007)