{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:30Z","timestamp":1725456030347},"publisher-location":"Berlin\/Heidelberg","reference-count":37,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026096","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"52-71","source":"Crossref","is-referenced-by-count":0,"title":["Parameter-reduction of higher level grammars"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky: Strictness analysis and polymorphic invariance. Programs as Data Objects, Proc. of a Workshop Copenhagen, Denmark, 1985, Lecture Notes in Comp. Sci. 217 pp. 1\u201323","DOI":"10.1007\/3-540-16446-4_1"},{"key":"5_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman: The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA, 1974"},{"key":"5_CR3","first-page":"223","volume":"13","author":"A. Arnold","year":"1976","unstructured":"A. Arnold, M Dauchet: Un theoreme de duplication pour les forets algebriques. JCSS 13, 1976, pp. 223\u2013244","journal-title":"JCSS"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(78)90510-7","volume":"37","author":"A. Arnold","year":"1978","unstructured":"A. Arnold, M. Dauchet: Forets algebriques et homomorphismes inverses. Inf. and Control 37, 1978, pp. 182\u2013196","journal-title":"Inf. and Control"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0019-9958(80)90698-1","volume":"46","author":"A. Arnold","year":"1980","unstructured":"A. Arnold, B. Leguy: Une propriete des forets algebriques \"de Greibach\". Inf. and Control 46, 1980, pp. 108\u2013134","journal-title":"Inf. and Control"},{"key":"5_CR6","volume-title":"The Lambda-Calculus","author":"H.P. Barendregt","year":"1981","unstructured":"H.P. Barendregt: The Lambda-Calculus. North Holland, Amsterdam, 1981"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"G.L. Burn, C.L. Hankin, S. Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects, Proc. of a Workshop, Copenhagen, Denmark 1985, Lecture Notes in Comp. Sci. 217, pp. 46\u201366","DOI":"10.1007\/3-540-16446-4_3"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-15975-4_28","volume":"201","author":"C. Clack","year":"1985","unstructured":"C. Clack, S.L.P. Jones: Strictness analysis \u2014 a practical approach. Functional Programming Languages and Computer Architecture, Lecture Notes in Comp. Sci. 201, 1985, pp. 35\u201349","journal-title":"Lecture Notes in Comp. Sci."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(78)90008-7","volume":"6","author":"B. Courcelle","year":"1978","unstructured":"B. Courcelle: A representation of trees by languages. TCS 6, 1978, pp. 255\u2013279 and TCS 7, 1978, pp. 25\u201355","journal-title":"TCS"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"42","author":"B. Courcelle","year":"1986","unstructured":"B. Courcelle: Equivalences and transformations of regular systems \u2014 applications to recursive program schemes and grammars. TCS 42, 1986, pp. 1\u2013122","journal-title":"TCS"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-08138-0_5","volume":"48","author":"W. Damm","year":"1977","unstructured":"W. Damm: Higer type program schemes and their tree languages. Proc. 3. GI-Conf. on Th. Comp. Sci. Lecture Notes in Comp. Sci. 48, 1977, S. 51\u201372","journal-title":"Proc. 3. GI-Conf. on Th. Comp. Sci. Lecture Notes in Comp. Sci."},{"key":"5_CR12","first-page":"164","volume":"52","author":"W. Damm","year":"1977","unstructured":"W. Damm: Languages defined by higher type program schemes. Proc. 4th Int. Coll. on Automata, Languages and Programming Lecture Notes in Comp. Sci. 52, 1977, pp. 164\u2013179","journal-title":"Proc. 4th Int. Coll. on Automata, Languages and Programming Lecture Notes in Comp. Sci."},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-09526-8_23","volume":"74","author":"W. Damm","year":"1979","unstructured":"W. Damm: An algebraic extension of the Chomsky-hierarchy. Proc. Conf. on Math. Foundations of Comp. Sci. Lecture Notes in Comp. Sci. 74, 1979, pp. 266\u2013276","journal-title":"Proc. Conf. on Math. Foundations of Comp. Sci. Lecture Notes in Comp. Sci."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"W. Damm: The IO-and OI-hierarchies. TCS 20, 1982, pp. 95\u2013205","journal-title":"TCS"},{"key":"5_CR15","unstructured":"W. Damm, E. Fehr: A schematological approach to the analysis of the procedure concept in ALGOL-languages. Proc. 5ieme Colloque sur les Arbres en Algebre et en Programmation, 1980, pp. 130\u2013134"},{"key":"5_CR16","first-page":"461","volume-title":"Formal Description of Programming Concepts","author":"W. Damm","year":"1978","unstructured":"W. Damm, E. Fehr, K. Indermark: Higher type recursion and self-application as control structures. In: E. Neuhold (ed.): Formal Description of Programming Concepts, North Holland, Amsterdam, 1978, pp. 461\u2013487"},{"key":"5_CR17","first-page":"1","volume":"71","author":"W. Damm","year":"1986","unstructured":"W. Damm, A. Goerdt: An automata-theoretical characterization of the OI-hierarchy. Inf. and Comp. 71, 1986, pp. 1\u201332","journal-title":"Inf. and Comp."},{"key":"5_CR18","unstructured":"W. Damm, I. Guessarian: Combining T and level N. Tech. Report Laboratoire Informatique Theorique et Programmation 81\u201311, 1981"},{"key":"5_CR19","unstructured":"W. Damm, I. Guessarian: Implementation techniques for recursive tree transducers on higher order data types. Tech. Report Laboratoire Informatique Theorique et Programmation 83\u201316, 1983"},{"key":"5_CR20","first-page":"328","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet, E.M. Schmidt; IO and OI. JCSS 15, 1977, pp. 328\u2013353, and JCSS 16, 1978, pp. 67\u201399","journal-title":"JCSS"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"J. Engelfriet: Iterated pushdown automata and complexity classes. Proc. 15th STOC, 1983, pp. 365\u2013373","DOI":"10.1145\/800061.808767"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"M.J. Fischer: Grammars with macro-like productions. Proc. 9th IEEE Conf. on Switching and Automata Theory, 1968, pp. 131\u2013141","DOI":"10.1109\/SWAT.1968.12"},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","volume":"30","author":"S. Fortune","year":"1983","unstructured":"S. Fortune, D. Leivant, M. o'Donnell: The expressiveness of simple and second order type structures. JACM 30, 1983, pp. 151\u2013185","journal-title":"JACM"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/0213047","volume":"13","author":"J.H. Gallier","year":"1984","unstructured":"J.H. Gallier: n-Rational algebras. SIAM J. of Computing 13, 1984, pp. 750\u2013794","journal-title":"SIAM J. of Computing"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"I. Guessarian: Program transformations and algebraic semantics. TCS 9, 1979, pp. 39\u201365","DOI":"10.1016\/0304-3975(79)90005-7"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"P. Hudak, J. Young: Higher-order strictness analysis in untyped lambda calculus. Proc. of the 13th Ann. Symp. on Principles of Programming Languages, 1986, pp. 97\u2013109","DOI":"10.1145\/512644.512653"},{"key":"5_CR27","unstructured":"B. Leguy: Reductions, transformations et classification des grammairs algebriques d'arbres. These de 3ieme cycle Lille, 1980"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"B. Leguy: Grammars without erasing rules, the OI-case. Proc. 6ieme Colloque sur les Arbres en Algebre et on Progammation, 1981, Lecture Notes in Comp. Sci. 112, pp. 268\u2013273","DOI":"10.1007\/3-540-10828-9_68"},{"key":"5_CR29","first-page":"409","volume":"8","author":"T.S.E. Maibaum","year":"1974","unstructured":"T.S.E. Maibaum: A generalized approach to formal languages. JCSS 8, 1974, pp. 409\u2013439","journal-title":"JCSS"},{"issue":"14","key":"5_CR30","first-page":"1170","volume":"15","author":"A.N. Maslov","year":"1974","unstructured":"A.N. Maslov: The hierarchy of indexed languages of an arbitrary level. Soviet. Math. Dokt. 15(14), 1974, pp. 1170\u20131174","journal-title":"Soviet. Math. Dokt."},{"key":"5_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner: Fully abstract models of typed lambda-calculus. TCS 4, 1977, pp. 1\u201322","journal-title":"TCS"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"A. Mycroft: The theory and practice of transforming call-by-need into call-by-value. Proc.4th Colloque International sur la Programmation Paris, 1980, pp. 269\u2013281","DOI":"10.1007\/3-540-09981-6_19"},{"key":"5_CR33","unstructured":"W.J. Paul: Kompexit\u00e4tstheorie. Teubner Stuttgart, 1978"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"E.M. Schmidt: Succinctness of description of contextfree, regular and finite languages. Datalogisk Afdelning Report DAIMI PB-84, Aarhus Univ., 1978","DOI":"10.7146\/dpb.v7i84.6500"},{"key":"5_CR35","unstructured":"H. Seidl: Regularit\u00e4t bei Grammatiken h\u00f6herer Stufe. Diss. Thesis, Frankfurt\/Main, 1986"},{"key":"5_CR36","unstructured":"H. Seidl: Parameter-reduction of Higher Level Grammars. To appear in TCS"},{"key":"5_CR37","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-07142-3_84","volume":"25","author":"M. Wand","year":"1975","unstructured":"M. Wand: An algebraic formulation of the Chomsky-hierarchy. Category Theory Applications to Computation and Control, Lecture Notes in Comp. Sci. 25, 1975, pp. 209\u2013219.","journal-title":"Category Theory Applications to Computation and Control, Lecture Notes in Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026096.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T14:38:54Z","timestamp":1683297534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/bfb0026096","relation":{},"subject":[]}}