{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:38Z","timestamp":1725516218800},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_18","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"261-275","source":"Crossref","is-referenced-by-count":2,"title":["Functional-Logic 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":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/S0956796800000411","volume":"2","author":"G. Hutton","year":"1992","unstructured":"Hutton, G.: Higher-order functions for parsing. Journal of Functional Programming\u00a02(3), 323\u2013343 (1992)","journal-title":"Journal of Functional Programming"},{"key":"18_CR2","first-page":"1","volume-title":"Advanced Functional Programming, First Intl. Spring School on Advanced Functional Programming Techniques-Tutorial Text","author":"J. Fokker","year":"1995","unstructured":"Fokker, J.: Functional parsers. In: Advanced Functional Programming, First Intl. Spring School on Advanced Functional Programming Techniques-Tutorial Text, London, UK, pp. 1\u201323. Springer, Heidelberg (1995)"},{"key":"18_CR3","volume-title":"Proc. of 19th Intl. Symp. on the Impl. and Appl. of Functional Languages","author":"S. Mazanek","year":"2008","unstructured":"Mazanek, S., Minas, M.: Graph parser combinators. In: Proc. of 19th Intl. Symp. on the Impl. and Appl. of Functional Languages. Springer, Heidelberg (2008)"},{"key":"18_CR4","unstructured":"Mazanek, S., Minas, M.: Parsing of hyperedge replacement grammars with graph parser combinators. In: Proc. of 7th Intl. Workshop on Graph Transf. and Visual Modeling Techniques. Electronic Communications of the EASST (to appear, 2008)"},{"issue":"2","key":"18_CR5","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":"18_CR6","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)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(91)90002-7","volume":"10","author":"T. Tanaka","year":"1991","unstructured":"Tanaka, T.: Definite-clause set grammars: a formalism for problem solving. J. Log. Program.\u00a010(1), 1\u201317 (1991)","journal-title":"J. Log. Program."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-74610-2_5","volume-title":"Logic Programming","author":"M. Hanus","year":"2007","unstructured":"Hanus, M.: Multi-paradigm declarative languages. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 45\u201375. Springer, Heidelberg (2007)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10705424_6","volume-title":"Functional and Logic Programming","author":"R. Caballero","year":"1999","unstructured":"Caballero, R., L\u00f3pez-Fraguas, F.J.: A functional-logic perspective of parsing. In: Middeldorp, A. (ed.) FLOPS 1999. LNCS, vol.\u00a01722, pp. 85\u201399. Springer, Heidelberg (1999)"},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C. Lautemann","year":"1989","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Inf.\u00a027(5), 399\u2013421 (1989)","journal-title":"Acta Inf."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"key":"18_CR12","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)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45788-7_4","volume-title":"Proc. of the 6th Intl. Symposium on Functional and Logic Programming","author":"S. Antoy","year":"2002","unstructured":"Antoy, S., Hanus, M.: Functional logic design patterns. In: Proc. of the 6th Intl. Symposium on Functional and Logic Programming. LNCS, vol.\u00a02441, pp. 67\u201387. Springer, Heidelberg (2002)"},{"key":"18_CR14","unstructured":"Hutton, G., Meijer, E.: Monadic parser combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham (1996)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/978-3-540-30203-2_25","volume-title":"Graph Transformations","author":"S. Seifert","year":"2004","unstructured":"Seifert, S., Fischer, I.: Parsing string generating hypergraph grammars. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 352\u2013367. Springer, Heidelberg (2004)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-19422-3_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Habel","year":"1988","unstructured":"Habel, A., Kreowski, H.J.: Pretty patterns produced by hyperedge replacement. In: G\u00f6ttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol.\u00a0314, pp. 32\u201345. Springer, Heidelberg (1988)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of AGTIVE 2007","author":"G. Taentzer","year":"2008","unstructured":"Taentzer, G., et al.: Generation of sierpinski triangles: A case study for graph transformation tools. In: Proc. of AGTIVE 2007. LNCS. Springer, Heidelberg (2008)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-48199-0_5","volume-title":"Proc. of the 4th Intl. Conference on Logical Aspects of Computational Linguistics","author":"P. Bottoni","year":"2001","unstructured":"Bottoni, P., Meyer, B., Marriott, K., Parisi-Presicce, F.: Deductive parsing of visual languages. In: Proc. of the 4th Intl. Conference on Logical Aspects of Computational Linguistics, London, UK, pp. 79\u201394. Springer, Heidelberg (2001)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J.S. Hodas","year":"1994","unstructured":"Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Inf. Comput.\u00a0110(2), 327\u2013365 (1994)","journal-title":"Inf. Comput."},{"issue":"12","key":"18_CR21","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/32.637392","volume":"23","author":"G. Costagliola","year":"1997","unstructured":"Costagliola, G., Lucia, A.D., Orefice, S., Tortora, G.: A parsing methodology for the implementation of visual systems. IEEE Trans. Softw. Eng.\u00a023(12), 777\u2013799 (1997)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:52Z","timestamp":1620015832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}