Krivine machines and higher-order schemes

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

Volumn 6756 LNCS, Issue PART 2, 2011, Pages 162-173

  Salvati, S ^a   Walukiewicz, I ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA MODELS; GLOBAL MODELS; HIGHER ORDER; HIGHER-ORDER SCHEME; LAMBDA-CALCULUS; MACHINE MODELS; MU-CALCULUS; PUSH-DOWN AUTOMATA; RECURSIVE SCHEME;

CALCULATIONS; COMPUTABILITY AND DECIDABILITY;

MODEL CHECKING;

EID: 79960004442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22012-8_12     Document Type: Conference Paper

References (20)

1. Aehlig, K., de Miranda, J.G., Ong, C.-H.L.: Safety is not a restriction at level 2 for string languages. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 490-504. Springer, Heidelberg (2005)
2. Broadbent, C., Carayol, A., Ong, L., Serre, O.: Recursion schemes and logical reflection. In: LICS, pp. 120-129 (2010)
3. Broadbent, C., Ong, C.-H.L.: On global model checking trees generated by higher-order recursion schemes. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 107-121. Springer, Heidelberg (2009)
4. Carayol, A., Hague, M., Meyer, A., Ong, L., Serre, O.: Winning regions of higher-order pushdown games. In: LICS, Pittsburgh, United States, pp. 193-204 (2008)
5. Curry, H.B., Feys, R.: Combinatory Logic, vol. 1. North-Holland Publishing Co., Amsterdam (1958)
6. Damm, W.: The IO- and OI-hierarchies. Theoretical Computer Science 20, 95-207 (1982)
7. Damm, W., Fehr, E.: A schematalogical approach to the alalysis of the procedure concept in Algol-languages. In: CLAAP, vol. 1, pp. 130-134. Université de Lille (1980)
8. de Miranda, J.: Structures generated by Higher-Order Grammars and the Safety Constraint. PhD thesis, Oxford University (2006)
9. Hague, M., Murawski, A.S., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452-461 (2008)
10. Huet, G.: Revsolution d'équations dans des langages d'ordre 1,2,.,ω. Thèse de doctorat en sciences mathématiques, Université Paris VII (1976)
11. Kartzow, A.: Collapsible pushdown graphs of level 2 are tree-automatic. In: STACS. LIPIcs, vol. 5, pp. 501-512 (2010)
12. 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)
13. Knapik, T., Niwinski, D., Urzycyzn, P., Walukiewicz, I.: Unsafe grammars and pannic automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1450-1461. Springer, Heidelberg (2005)
14. Kobayashi, N., Ong, L.: A type system equivalent to modal mu-calculus model checking of recursion schemes. In: LICS, pp. 179-188 (2009)
15. Krivine, J.-L.: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation 20(3), 199-207 (2007)
16. Luke Ong, C.-H.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81-90 (2006)
17. Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 223-255 (1977)
18. Salvati, S., Walukiewicz, I.: Krivine machines and higher-order schemes (2011), http://www.labri.fr/perso/salvati/downloads/articles/hpda-dec.pdf
19. Walukiewicz, I.: Pushdown processes: Games and model checking. Information and Computation 164(2), 234-263 (2001)
20. Wand, M.: On the correctness of the Krivine machine. Higher-Order and Symbolic Computation 20, 231-235 (2007), 10.1007/s10990-007-9019-8