{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:56Z","timestamp":1763468036378,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,26]],"date-time":"2011-03-26T00:00:00Z","timestamp":1301097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,26]]},"DOI":"10.1145\/1988783.1988790","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Yield grammar analysis in the Bellman's GAP compiler"],"prefix":"10.1145","author":[{"given":"Robert","family":"Giegerich","sequence":"first","affiliation":[{"name":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany"}]},{"given":"Georg","family":"Sauthoff","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Dynamic Programming. PUP","author":"Bellman R. E.","year":"1957","unstructured":"R. E. Bellman . Dynamic Programming. PUP , 1957 . R. E. Bellman. Dynamic Programming. PUP, 1957."},{"key":"e_1_3_2_1_2_1","volume-title":"d. Moor. Algebra of Programming. PH","author":"Bird R. S.","year":"1997","unstructured":"R. S. Bird and O. d. Moor. Algebra of Programming. PH , 1997 . R. S. Bird and O. d. Moor. Algebra of Programming. PH, 1997."},{"key":"e_1_3_2_1_3_1","first-page":"56","volume-title":"Proc. of the 5th ISCB","author":"Birney E.","year":"1997","unstructured":"E. Birney and R. Durbin . Dynamite: A flexible code generating language for dynamic programming methods used in sequence comparison . In Proc. of the 5th ISCB , pages 56 -- 64 , 1997 . E. Birney and R. Durbin. Dynamite: A flexible code generating language for dynamic programming methods used in sequence comparison. In Proc. of the 5th ISCB, pages 56--64, 1997."},{"issue":"3","key":"e_1_3_2_1_4_1","first-page":"176","volume":"75","author":"Brabrand C.","year":"2010","unstructured":"C. Brabrand , R. Giegerich , and A. M\u00f8ller . Analyzing Ambiguity of Context-Free Grammars. SCICO , 75 ( 3 ): 176 -- 191 , March 2010 . C. Brabrand, R. Giegerich, and A. M\u00f8ller. Analyzing Ambiguity of Context-Free Grammars. SCICO, 75(3):176--191, March 2010.","journal-title":"Analyzing Ambiguity of Context-Free Grammars. SCICO"},{"key":"e_1_3_2_1_5_1","first-page":"309","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990","unstructured":"T. H. Cormen , C. E. Leiserson , and R. L. Rivest . Introduction to Algorithms , pages 309 -- 314 . MIT Press , 1990 . T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, pages 309--314. MIT Press, 1990."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220611"},{"key":"e_1_3_2_1_7_1","first-page":"77","volume-title":"Proc. WAAAPL","author":"Giegerich R.","year":"1999","unstructured":"R. Giegerich , S. Kurtz , and G. Weiller . An algebraic dynamic programming approach to the analysis of recombinant DNA sequences . In Proc. WAAAPL , pages 77 -- 88 , 1999 . R. Giegerich, S. Kurtz, and G. Weiller. An algebraic dynamic programming approach to the analysis of recombinant DNA sequences. In Proc. WAAAPL, pages 77--88, 1999."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2003.12.005"},{"key":"e_1_3_2_1_9_1","first-page":"2386","article-title":"Implementing algebraic dynamic programming in the functional and the imperative programming paradigm. In E. Boiten and B. M\u00f6ller, editors, Mathematics of Program Construction, pages 1--20","author":"Giegerich R.","year":"2002","unstructured":"R. Giegerich and P. Steffen . Implementing algebraic dynamic programming in the functional and the imperative programming paradigm. In E. Boiten and B. M\u00f6ller, editors, Mathematics of Program Construction, pages 1--20 . LNCS 2386 , 2002 . R. Giegerich and P. Steffen. Implementing algebraic dynamic programming in the functional and the imperative programming paradigm. In E. Boiten and B. M\u00f6ller, editors, Mathematics of Program Construction, pages 1--20. LNCS 2386, 2002.","journal-title":"LNCS"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh779"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00818163"},{"key":"e_1_3_2_1_12_1","volume-title":"ISCB","author":"Holmes I.","year":"2000","unstructured":"I. Holmes , S. Slater , E. Birney , and G. M. Rubin . Telegraph: A new dynamic programming library . In ISCB , 2000 . I. Holmes, S. Slater, E. Birney, and G. M. Rubin. Telegraph: A new dynamic programming library. In ISCB, 2000."},{"key":"e_1_3_2_1_13_1","volume-title":"A short cut to optimal sequences. New Generation Computing, accepted","author":"Morihata A.","year":"2010","unstructured":"A. Morihata . A short cut to optimal sequences. New Generation Computing, accepted , 2010 . A. Morihata. A short cut to optimal sequences. New Generation Computing, accepted, 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(82)90223-2"},{"key":"e_1_3_2_1_15_1","volume-title":"Manuscript","author":"Rote G.","year":"1989","unstructured":"G. Rote . Path problems in graphs , Manuscript , 1989 . G. Rote. Path problems in graphs, Manuscript, 1989."},{"key":"e_1_3_2_1_17_1","volume-title":"Bellman's GAP language report. Technical report","author":"Sauthoff G.","year":"2010","unstructured":"G. Sauthoff and R. Giegerich . Bellman's GAP language report. Technical report , Bielefeld University , 2010 . G. Sauthoff and R. Giegerich. Bellman's GAP language report. Technical report, Bielefeld University, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-6-224"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.02.006"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of the 10th ACM SIGPLAN ICFP","author":"Swadi K.","year":"2005","unstructured":"K. Swadi , W. Taha , and O. Kiselyov . Staging dynamic programming algorithms . In Proc. of the 10th ACM SIGPLAN ICFP , 2005 . K. Swadi, W. Taha, and O. Kiselyov. Staging dynamic programming algorithms. In Proc. of the 10th ACM SIGPLAN ICFP, 2005."}],"event":{"name":"LDTA '11: Language Descriptions, Tools, and Applications","sponsor":["University of Minnesota Software Engineering Center","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Saarbrucken Germany","acronym":"LDTA '11"},"container-title":["Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1988783.1988790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1988783.1988790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:08Z","timestamp":1750244768000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1988783.1988790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,26]]},"references-count":19,"alternative-id":["10.1145\/1988783.1988790","10.1145\/1988783"],"URL":"https:\/\/doi.org\/10.1145\/1988783.1988790","relation":{},"subject":[],"published":{"date-parts":[[2011,3,26]]},"assertion":[{"value":"2011-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}