{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:32:51Z","timestamp":1762032771132,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853725"},{"type":"electronic","value":"9783540853732"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85373-2_1","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T11:34:54Z","timestamp":1219232094000},"page":"1-18","source":"Crossref","is-referenced-by-count":1,"title":["Graph Parser Combinators"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Mazanek","sequence":"first","affiliation":[]},{"given":"Mark","family":"Minas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0167-6423(02)00037-0","volume":"44","author":"M. Minas","year":"2002","unstructured":"Minas, M.: Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming\u00a044(2), 157\u2013180 (2002)","journal-title":"Science of Computer Programming"},{"key":"1_CR2","unstructured":"Kasami, T.: An efficient recognition and syntax analysis algorithm for context free languages. Scientific Report AF CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Massachussetts (1965)"},{"key":"1_CR3","series-title":"Foundations","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a0I, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"key":"1_CR4","unstructured":"Hutton, G., Meijer, E.: Monadic parser combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham (1996)"},{"key":"1_CR5","unstructured":"Johnson, S.C.: Yacc: Yet another compiler compiler. Technical Report\u00a032, Bell Laboratories, Murray Hill, New Jersey (1975)"},{"key":"1_CR6","unstructured":"Wallace, M.: PolyParse (2007), \n                    http:\/\/www.cs.york.ac.uk\/fp\/polyparse\/"},{"key":"1_CR7","unstructured":"Peyton Jones, S.: Haskell 98 Language and Libraries. The Revised Report. Cambridge University Press (2003)"},{"key":"1_CR8","first-page":"294","volume-title":"Proc. 11th IEEE Symp. Vis. Lang","author":"W. Citrin","year":"1995","unstructured":"Citrin, W., Hall, R., Zorn, B.: Programming with visual expressions. In: Haarslev, V. (ed.) Proc. 11th IEEE Symp. Vis. Lang, pp. 294\u2013301. IEEE Computer Soc. Press, Los Alamitos (1995)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-540-46464-8_20","volume-title":"Theory and Application of Graph Transformations","author":"M. Minas","year":"2000","unstructured":"Minas, M.: Hypergraphs as a uniform diagram representation model. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 281\u2013295. Springer, Heidelberg (2000)"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0956796801004075","volume":"11","author":"M. Erwig","year":"2001","unstructured":"Erwig, M.: Inductive graphs and functional graph algorithms. J. Funct. Program.\u00a011(5), 467\u2013492 (2001)","journal-title":"J. Funct. Program."},{"key":"1_CR11","unstructured":"Leijen, D., Meijer, E.: Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-27, Dept. of Comp. Science, Universiteit Utrecht (2001)"},{"key":"1_CR12","unstructured":"Gill, A., Marlow, S.: Happy - the parser generator for Haskell, \n                    http:\/\/www.haskell.org\/happy"},{"key":"1_CR13","unstructured":"King, D.: Functional Programming and Graph Algorithms. PhD thesis, University of Glasgow (1996)"},{"key":"1_CR14","unstructured":"Erwig, M.: FGL - A Functional Graph Library, \n                    http:\/\/web.engr.oregonstate.edu\/~erwig\/fgl\/haskell\/"},{"key":"1_CR15","unstructured":"Erwig, M.: A functional homage to graph reduction. Technical Report 239, FernUniversit\u00e4t Hagen (1998)"},{"key":"1_CR16","unstructured":"Schneider, H.J.: Graph transformations - an introduction to the categorical approach (2007), \n                    http:\/\/www2.cs.fau.de\/~schneide\/gtbook\/"},{"key":"1_CR17","unstructured":"Kahl, W., Schmidt, G.: Exploring (finite) Relation Algebras using Tools written in Haskell. Technical Report 2000-02, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr, M\u00fcnchen (2000)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-47849-3_7","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"S.D. Swierstra","year":"1999","unstructured":"Swierstra, S.D., Azero Alcocer, P.R.: Fast, error correcting parser combinators: a short tutorial. In: Pavelka, J., Tel, G., Bartosek, M. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 111\u2013129. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85373-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T05:05:02Z","timestamp":1715144702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85373-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853725","9783540853732"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85373-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}