{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:47:19Z","timestamp":1767912439270,"version":"3.49.0"},"reference-count":72,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11400,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,5]]},"DOI":"10.1016\/0304-3975(82)90009-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"95-207","source":"Crossref","is-referenced-by-count":127,"title":["The IO- and OI-hierarchies"],"prefix":"10.1016","volume":"20","author":[{"given":"Werner","family":"Damm","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90009-3_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0096-0551(75)90017-X","article-title":"A lambda-calculus model of programming languages I, II","volume":"1","author":"Abdali","year":"1976","journal-title":"J. Comput. Languages"},{"issue":"4","key":"10.1016\/0304-3975(82)90009-3_BIB2","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars\u2014an extension of context-free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90009-3_BIB3","first-page":"38","article-title":"Languages with reducing reflexive types","volume":"85","author":"Astesiano","year":"1980"},{"key":"10.1016\/0304-3975(82)90009-3_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(75)80004-3","article-title":"Two-way nested stack automata are equivalent to two-way stack automata","volume":"10","author":"Beeri","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB5","first-page":"117","article-title":"Top\u2013down tree-transducers for infinite trees I","volume":"112","author":"Bilstein","year":"1981"},{"key":"10.1016\/0304-3975(82)90009-3_BIB6","series-title":"A new complexity measure for languages","author":"Boasson","year":"1977"},{"key":"10.1016\/0304-3975(82)90009-3_BIB8_1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(78)90008-7","article-title":"A representation of trees by languages","volume":"6","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB8_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","article-title":"A representation of trees by languages","volume":"7","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB9","article-title":"Attribute grammars and recursive program schemes","volume":"1","author":"Courcelle","year":"1980"},{"key":"10.1016\/0304-3975(82)90009-3_BIB10","article-title":"The algebraic semantics of recursive program schemes","author":"Courcelle","year":"1978","journal-title":"IRIA Laboratory Report 300"},{"key":"10.1016\/0304-3975(82)90009-3_BIB11","volume":"Vol. 1","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(82)90009-3_BIB12","first-page":"51","article-title":"Higher type program schemes and their tree languages","volume":"48","author":"Damm","year":"1977"},{"key":"10.1016\/0304-3975(82)90009-3_BIB13","first-page":"164","article-title":"Languages defined by higher type program schemes","volume":"52","author":"Damm","year":"1977"},{"key":"10.1016\/0304-3975(82)90009-3_BIB14","first-page":"266","article-title":"An algebraic extension of the Chomsky-hierarchy","volume":"74","author":"Damm","year":"1979"},{"key":"10.1016\/0304-3975(82)90009-3_BIB15","article-title":"A note on nondeterministic n-rational schemes","author":"Damm","year":"1980","journal-title":"Schr. Informatik Angew. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB16","article-title":"The IO- and OI-hierarchies","volume":"41","author":"Damm","year":"1981","journal-title":"Schr. Informatik Angew. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB17","first-page":"177","article-title":"On the power of self-application and higher type recursion","volume":"62","author":"Damm","year":"1978"},{"key":"10.1016\/0304-3975(82)90009-3_BIB18","first-page":"130","article-title":"A schematological approach to the analysis of the procedure concept in ALGOL-languages","author":"Damm","year":"1980","journal-title":"Proc. 5 i\u00e8me Colloque sur les Arbres en Algebre et en Programmation"},{"key":"10.1016\/0304-3975(82)90009-3_BIB19","unstructured":"W. Damm and E. Fehr, A schematological approach to the analysis of the procedure concept in ALGOL-languages, Schr. Informatik Angew. Math., to appear."},{"key":"10.1016\/0304-3975(82)90009-3_BIB20","first-page":"461","article-title":"Higher type recursion and self-application as control structures","author":"Damm","year":"1978"},{"key":"10.1016\/0304-3975(82)90009-3_BIB21","doi-asserted-by":"crossref","unstructured":"W. Damm and A. Goerdt, An automata-theoretic characterization of the OI-hierarchy, Schr. Informatik Angew. Math., to appear.","DOI":"10.1007\/BFb0012764"},{"key":"10.1016\/0304-3975(82)90009-3_BIB22","first-page":"220","article-title":"Typed meaning in Scott's \u03bb-calculus models","volume":"37","author":"Egli","year":"1975"},{"key":"10.1016\/0304-3975(82)90009-3_BIB23","series-title":"Datalogisk Afdelning Report","article-title":"Tree automata and tree grammars","author":"Engelfriet","year":"1975"},{"key":"10.1016\/0304-3975(82)90009-3_BIB24","series-title":"Proc. Symposium on Formal Language Theory","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1979"},{"key":"10.1016\/0304-3975(82)90009-3_BIB25","first-page":"1","article-title":"Two-way automata and checking automata","volume":"Vol. 1","author":"Engelfriet","year":"1979","journal-title":"Foundations of Computer Science III"},{"key":"10.1016\/0304-3975(82)90009-3_BIB26","unstructured":"J. Engelfriet, Private communication (1979)."},{"key":"10.1016\/0304-3975(82)90009-3_BIB27","series-title":"Memorandum 217","article-title":"Three hierarchies of transducers","author":"Engelfriet","year":"1978"},{"issue":"3","key":"10.1016\/0304-3975(82)90009-3_BIB28_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB28_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI","volume":"16","author":"Engelfriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB29","article-title":"Lambda-calculus as control structures of programming languages","volume":"57","author":"Fehr","year":"1980","journal-title":"Schr. Informatik Angew. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB30","first-page":"131","article-title":"Grammars with macro-like productions","author":"Fischer","year":"1968","journal-title":"Proc. 9th IEEE Conference on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(82)90009-3_BIB31","first-page":"113","article-title":"Program schemes, recursion schemes, and formal languages","volume":"7","author":"Garland","year":"1979","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB32","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB33","article-title":"On derivations trees of indexed grammars \u2013an extension of the uvwxy-theorem","volume":"9","author":"Hayaschi","year":"1973","journal-title":"Publ. Res. Inst. Math. Sci."},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/0209005","article-title":"The semantic of call by value and call by name in a nondeterministic environment","volume":"9","author":"Hennessy","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90009-3_BIB35","first-page":"352","article-title":"Schemes with recursion on higher types","volume":"45","author":"Indermark","year":"1976"},{"key":"10.1016\/0304-3975(82)90009-3_BIB36","article-title":"On rational definitions in complete algebras without rank","volume":"64","author":"Indermark","year":"1980","journal-title":"Schr. Informatik Ange. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB37","first-page":"83","article-title":"A correspondence between ALGOL 60 and Church's lambda notation","volume":"8","author":"Landin","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90009-3_BIB38_1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289503","article-title":"On procedures as open subroutines","volume":"2","author":"Langmaack","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90009-3_BIB38_2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00288636","article-title":"On procedures as open subroutines","volume":"3","author":"Langmaack","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90009-3_BIB39","first-page":"538","article-title":"On a theory of decision problems in programming languages","volume":"75","author":"Langmaack","year":"1979"},{"issue":"3","key":"10.1016\/0304-3975(82)90009-3_BIB40","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/356589.356592","article-title":"Ten mini languages: A study of topical issues in programming languages","volume":"3","author":"Ledgard","year":"1971","journal-title":"Comput. Surveys"},{"key":"10.1016\/0304-3975(82)90009-3_BIB41","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","article-title":"On formalised computer programs","volume":"4","author":"Luckham","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB42","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0022-0000(74)80031-0","article-title":"A generalized approach to formal languages","volume":"8","author":"Maibaum","year":"1974","journal-title":"J. Comput. System Sci."},{"issue":"14","key":"10.1016\/0304-3975(82)90009-3_BIB43","first-page":"1170","article-title":"The hierarchy of indexed languages of an arbitrary level","volume":"15","author":"Maslov","year":"1974","journal-title":"Soviet. Math. Dokl."},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB44","first-page":"55","article-title":"Multilevel stack automata","volume":"12","author":"Maslov","year":"1976","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0304-3975(82)90009-3_BIB45","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","article-title":"Algebraic automata and context-free sets","volume":"11","author":"Mezei","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90009-3_BIB46","article-title":"The mathematical semantics of ALGOL 68","author":"Milne","year":"1972","journal-title":"PRG report Oxford"},{"key":"10.1016\/0304-3975(82)90009-3_BIB47","series-title":"A Theory of Programming Language Semantics, Part a and b","author":"Milne","year":"1976"},{"key":"10.1016\/0304-3975(82)90009-3_BIB48","series-title":"Memo AIM-186","article-title":"Models of LCF","author":"Milner","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(82)90009-3_BIB49","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/malq.19790250104","article-title":"The standardization theorem for \u03bb-calculus","volume":"25","author":"Mitschke","year":"1979","journal-title":"Z. Math. Logik. Grundlag. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB50","article-title":"Lambda calculus models of programming languages","author":"Morris","year":"1968","journal-title":"Project MAC Report TR-57"},{"key":"10.1016\/0304-3975(82)90009-3_BIB51","article-title":"The mathematical semantics of ALGOL 60","author":"Mosses","year":"1974","journal-title":"PRG-Report 12"},{"key":"10.1016\/0304-3975(82)90009-3_BIB52","first-page":"293","article-title":"Langages alg\u00e9briques sur le magma libre et s\u00e9mantique des sch\u00e9mas de programme","author":"Nivat","year":"1972"},{"key":"10.1016\/0304-3975(82)90009-3_BIB53","article-title":"On the interpretation of recursive program schemes, Symposia Matematica","author":"Nivat","year":"1972","journal-title":"Atti del convegno d'Informatica theorica"},{"issue":"3","key":"10.1016\/0304-3975(82)90009-3_BIB54","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90009-3_BIB55","article-title":"Towards a theory of type structure","author":"Reynolds","year":"1974","journal-title":"Colloquium on Programming"},{"key":"10.1016\/0304-3975(82)90009-3_BIB56","first-page":"109","article-title":"Tree-oriented proofs of some theorems on context-free and indexed languages","author":"Rounds","year":"1970","journal-title":"2nd Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90009-3_BIB57","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(82)90009-3_BIB58","series-title":"Datalogisk Afdelning Report","article-title":"Succintness of description of context-free, regular, and finite languages","author":"Schmidt","year":"1978"},{"key":"10.1016\/0304-3975(82)90009-3_BIB59","first-page":"311","article-title":"The lattice of flow diagrams","volume":"188","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(82)90009-3_BIB60","first-page":"97","article-title":"Continuous lattices","volume":"274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(82)90009-3_BIB61","article-title":"Evaluation des index rationnels de quelques families de langages","author":"Steyaert","year":"1977","journal-title":"IRIA-Report No. 261"},{"key":"10.1016\/0304-3975(82)90009-3_BIB62","series-title":"Denotational Semantics: The Scott\u2013Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(82)90009-3_BIB63","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(82)90009-3_BIB64","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/360303.360308","article-title":"The denotational semantics of programming languages","volume":"19","author":"Tennent","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90009-3_BIB65","first-page":"143","article-title":"Tree automata: an informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/0304-3975(82)90009-3_BIB66","first-page":"426","article-title":"An algebraic theory of formal languages","volume":"32","author":"Turner","year":"1975"},{"key":"10.1016\/0304-3975(82)90009-3_BIB67","article-title":"Syntaxe, s\u00e9mantique et axiomatique d'un language de programmation simple","volume":"VI","author":"Vuillemin","year":"1974"},{"issue":"3","key":"10.1016\/0304-3975(82)90009-3_BIB68","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's Dx-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90009-3_BIB69","first-page":"331","article-title":"A concrete approach to abstract recursive definitions","author":"Wand","year":"1973"},{"key":"10.1016\/0304-3975(82)90009-3_BIB70","first-page":"209","article-title":"An algebraic formulation of the Chomsky-hierarchy","volume":"25","author":"Wand","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:27:00Z","timestamp":1555126020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0304397582900093"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90009-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}