{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:31Z","timestamp":1761597331634},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578802"},{"type":"electronic","value":"9783540483762"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57880-3_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:36:31Z","timestamp":1330263391000},"page":"317-332","source":"Crossref","is-referenced-by-count":4,"title":["Bottom-up grammar analysis \u2014 A functional formulation"],"prefix":"10.1007","author":[{"given":"Johan","family":"Jeuring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doaitse","family":"Swierstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R.S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume F36 of NATO ASI Series, pages 5\u201342. Springer-Verlag, 1987.","key":"21_CR1","DOI":"10.1007\/978-3-642-87374-4_1"},{"unstructured":"B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.","key":"21_CR2"},{"doi-asserted-by":"crossref","unstructured":"J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992.","key":"21_CR3","DOI":"10.1145\/130697.130699"},{"unstructured":"Andy Gill and Simon Marlow. Happy manual. Published on comp.lang.functional, 1993.","key":"21_CR4"},{"unstructured":"J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht University, 1993.","key":"21_CR5"},{"doi-asserted-by":"crossref","unstructured":"J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis \u2014 a functional formulation-. Technical Report UU-CS-1994-01, Utrecht University, 1994.","key":"21_CR6","DOI":"10.1007\/3-540-57880-3_21"},{"unstructured":"M.P. Jones. Introduction to Gofer 2.20. Programming Research Group, Oxford University, 1992.","key":"21_CR7"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G. Malcolm","year":"1990","unstructured":"G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255\u2013279, 1990.","journal-title":"Science of Computer Programming"},{"unstructured":"L. Meertens. Algorithmics-towards programming as a mathematical activity. In J.W. de Bakker, M. Hazewinkel, and J.K. Lenstra, editors, Proceedings of the CWI Symposium on Mathematics and Computer Science, volume 1 of CWI Monographs, pages 289\u2013334. North-Holland, 1986.","key":"21_CR9"},{"unstructured":"Torben Mogensen. Ratatosk \u2014 a parser generator and scanner generator for Gofer. Published on comp.lang.functional, 1993.","key":"21_CR10"},{"key":"21_CR11","series-title":"LNCS 545","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-54572-7_6","volume-title":"Attribute Grammars, Applications and Systems, SAGA '91","author":"U. M\u00f6ncke","year":"1991","unstructured":"Ulrich M\u00f6ncke and Reinhard Wilhelm. Grammar flow analysis. In Attribute Grammars, Applications and Systems, SAGA '91, pages 151\u2013186. Springer-Verlag, New York, 1991. LNCS 545."},{"issue":"8","key":"21_CR12","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1002\/spe.4380150807","volume":"15","author":"S. L. P. Jones","year":"1985","unstructured":"Simon L. Peyton Jones. Yacc in Sasl \u2014 an exercise in functional programming. Software-Practice and Experience, 15(8):807\u2013820, 1985.","journal-title":"Software-Practice and Experience"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P. Wadler","year":"1992","unstructured":"P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2:461\u2013493, 1992.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems \u2014 ESOP '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57880-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:17Z","timestamp":1605647717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57880-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578802","9783540483762"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57880-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}