Untyped recursion schemes and infinite intersection types

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

Volumn 6014 LNCS, Issue , 2010, Pages 343-357

  Tsukada, Takeshi ^a   Kobayashi, Naoki ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DECIDABLE SUBSETS; FUNCTIONAL PROGRAMS; HIGHER ORDER; INTERSECTION TYPES; LAMBDA-CALCULUS; MODEL CHECKING ALGORITHM; PROGRAM VERIFICATION; RECURSION SCHEMES; RECURSIONS; TYPE SYSTEMS; TYPECHECKING;

CALCULATIONS; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS);

MODEL CHECKING;

EID: 77951439728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12032-9_24     Document Type: Conference Paper

References (17)

1. Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205-222. Springer, Heidelberg (2002)
2. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81-90. IEEE Computer Society Press, Los Alamitos (2006)
3. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pp. 416-428 (2009)
4. Kobayashi, N., Tabuchi, N., Unno, H.: Higher-order multi-parameter tree transducers and recursion schemes for program verification. In: POPL, pp. 495-507 (2010)
5. Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of LICS 2009, pp. 179-188. IEEE Computer Society Press, Los Alamitos (2009)
6. van Bakel, S.: Intersection type assignment systems. Theor. Comput. Sci. 151(2), 385-435 (1995)
7. Leivant, D.: Discrete polymorphism. In: LISP and Functional Programming, pp. 288-297 (1990)
8. Minsky, M.L.: Computation: Finite and infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
9. Kobayashi, N.: Model-checking higher-order functions. In: Proceedings of PPDP 2009. ACM Press, New York (2009)
10. Hallett, J.J., Kfoury, A.J.: Programming examples needing polymorphic recursion. Electr. Notes Theor. Comput. Sci. 136, 57-102 (2005)
11. Terauchi, T., Aiken, A.: On typability for rank-2 intersection types with polymorphic recursion. In: LICS, pp. 111-122. IEEE Computer Society, Los Alamitos (2006)
12. Knapik, T., Niwinski, D., Urzyczyn, P.: Deciding monadic theories of hyperalgebraic trees. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 253-267. Springer, Heidelberg (2001)
13. Aehlig, K., de Miranda, J.G., Ong, C.-H.L.: The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 39-54. Springer, Heidelberg (2005)
14. Bonsangue, M.M., Kok, J.N.: Infinite intersection types. Inf. Comput. 186(2), 285-318 (2003)
15. Berarducci, A., Dezani-Ciancaglini, M.: Infinite lambda-calculus and types. Theor. Comput. Sci. 212(1-2), 29-75 (1999)
16. Tatsuta, M.: Types for hereditary head normalizing terms. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 195-209. Springer, Heidelberg (2008)
17. Tatsuta, M.: Types for hereditary permutators. In: LICS, pp. 83-92. IEEE Computer Society, Los Alamitos (2008)