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