Klaus Aehlig
2006
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
"Proc. of Computer Science Logic, 20th Annual Conference of the EACSL"
Lecture Notes in Comput. Sci.
4207
Springer-Verlag
104–118
10.1007/11874683_7
Bruno Courcelle
1978
A Representation of Trees by Languages I
Theoret. Comput. Sci.
6
255–279
10.1016/0304-3975(78)90008-7
Bruno Courcelle
1978
A Representation of Trees by Languages II
Theoret. Comput. Sci.
7
25–55
10.1016/0304-3975(78)90039-7
Bruno Courcelle
Maurice Nivat
1978
The Algebraic Semantics of Recursive Program Schemes
Proc. 7th Symposium, Mathematical Foundations of Computer Science 1978
Lecture Notes in Comput. Sci.
64
Springer-Verlag
16–30
Werner Damm
1977
Higher type program schemes and their tree languages
Theoretical Computer Science, 3rd GI-Conference
Lecture Notes in Comput. Sci.
48
Springer-Verlag
51–72
Werner Damm
1977
Languages Defined by Higher Type Program Schemes
Proc. 4th Colloq. on Automata, Languages, and Programming (ICALP)
Lecture Notes in Comput. Sci.
52
Springer-Verlag
164–179
Werner Damm
1982
The IO- and OI-Hierarchies.
Theoret. Comput. Sci.
20
95–207
10.1016/0304-3975(82)90009-3
Joost Engelfriet
Erik Meineche Schmidt
1977
IO and OI. I
J. Comput. System Sci.
15
3
328–353
10.1016/S0022-0000(77)80034-2
Joost Engelfriet
Erik Meineche Schmidt
1978
IO and OI. II
J. Comput. System Sci.
16
1
67–99
10.1016/0022-0000(78)90051-X
Matthew Hague
Andrzej S. Murawski
C.-H. Luke Ong
Olivier Serre
2008
Collapsible Pushdown Automata and Recursion Schemes
Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS)
IEEE Computer Society
452–461
Klaus Indermark
1976
Schemes with Recursion on Higher Types
Proc. 5th Symposium, Mathematical Foundations of Computer Science 1976
Lecture Notes in Comput. Sci.
45
Springer-Verlag
352–358
Teodor Knapik
Damian Niwiński
Pawel Urzyczyn
2002
Higher-Order Pushdown Trees Are Easy
Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
Lecture Notes in Comput. Sci.
2303
Springer-Verlag
205–222
10.1007/3-540-45931-6_15
Naoki Kobayashi
2009
Types and higher-order recursion schemes for verification of higher-order programs
Proc. 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
ACM
416–428
Naoki Kobayashi
C.-H. Luke Ong
2009
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science (LICS)
IEEE Computer Society
179–188
M. Nivat
1972
On the interpretation of recursive program schemes
Symposia Matematica