{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:23:50Z","timestamp":1764361430432,"version":"3.46.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031997501"},{"type":"electronic","value":"9783031997518"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99751-8_12","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:19:45Z","timestamp":1759281585000},"page":"283-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Type Theoretic Treatment of\u00a0Context-Free Languages Without Mutual Recursion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6837-3757","authenticated-orcid":false,"given":"Jaro","family":"Reinders","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0622-7639","authenticated-orcid":false,"given":"Casper","family":"Bach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Afroozeh, A., Izmaylova, A.: One parser to rule them all. In: 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), Onward! 2015, pp. 151\u2013170. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2814228.2814242","DOI":"10.1145\/2814228.2814242"},{"key":"12_CR2","unstructured":"Allais, G.: Agdarsec - total parser combinators, pp. 45\u201359 (2018), publisher Copyright: JFLA 2018 - Journees Francophones des Langages Applicatifs. All rights reserved. Sylvie Boldo, Nicolas Magaud. Journ\u00e9es Francophones des Langages Applicatifs 2018. Sylvie Boldo; Nicolas Magaud. Journ\u00e9es Francophones des Langages Applicatifs 2018, Jan 2018, Banyuls-sur-Mer, France. publi\u00e9 par les auteurs, 2018. $$\\langle $$hal-01707376$$\\rangle $$; Vingt-neuviemes Journees Francophones des Langages Applicatifs, JFLA 2018 - 29th French-Speaking Conference on Applicative Languages, JFLA 2018 ; Conference date: 24-01-2018 Through 27-01-2018"},{"key":"12_CR3","unstructured":"Basten, B.: Ambiguity Detection for Programming Language Grammars. Theses, Universiteit van Amsterdam (2011). https:\/\/theses.hal.science\/tel-00644079"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bernardy, J., Jansson, P.: Certified context-free parsing: a formalisation of valiant\u2019s algorithm in agda. Log. Methods Comput. Sci. 12(2) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(2:6)2016","DOI":"10.2168\/LMCS-12(2:6)2016"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/J.SCICO.2009.11.002","volume":"75","author":"C Brabrand","year":"2010","unstructured":"Brabrand, C., Giegerich, R., M\u00f8ller, A.: Analyzing ambiguity of context-free grammars. Sci. Comput. Program. 75(3), 176\u2013191 (2010). https:\/\/doi.org\/10.1016\/J.SCICO.2009.11.002","journal-title":"Sci. Comput. Program."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-24276-2_7","volume-title":"Implementation and Application of Functional Languages","author":"A Middelkoop","year":"2011","unstructured":"Middelkoop, A., Dijkstra, A., Swierstra, S.D.: Dependently typed attribute grammars. In: Hage, J., Moraz\u00e1n, M.T. (eds.) IFL 2010. LNCS, vol. 6647, pp. 105\u2013120. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24276-2_7"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). https:\/\/doi.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Chapman, J., Dagand, P.E., McBride, C., Morris, P.: The gentle art of levitation. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP \u201910, pp. 3\u201314. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1863543.1863547","DOI":"10.1145\/1863543.1863547"},{"issue":"9","key":"12_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1932681.1863547","volume":"45","author":"J Chapman","year":"2010","unstructured":"Chapman, J., Dagand, P.E., McBride, C., Morris, P.: The gentle art of levitation. SIGPLAN Not. 45(9), 3\u201314 (2010). https:\/\/doi.org\/10.1145\/1932681.1863547","journal-title":"SIGPLAN Not."},{"issue":"9","key":"12_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/1932681.1863585","volume":"45","author":"NA Danielsson","year":"2010","unstructured":"Danielsson, N.A.: Total parser combinators. SIGPLAN Not. 45(9), 285\u2013296 (2010). https:\/\/doi.org\/10.1145\/1932681.1863585","journal-title":"SIGPLAN Not."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Elliott, C.: Symbolic and automatic differentiation of languages. Proc. ACM Program. Lang. 5(ICFP) (2021). https:\/\/doi.org\/10.1145\/3473583","DOI":"10.1145\/3473583"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Firsov, D., Uustalu, T.: Certified cyk parsing of context-free languages. J. Log. Algeb. Methods Program. 83(5), 459\u2013468 (2014). https:\/\/doi.org\/10.1016\/j.jlamp.2014.09.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352220814000601","DOI":"10.1016\/j.jlamp.2014.09.002"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Firsov, D., Uustalu, T.: Certified normalization of context-free grammars. In: Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP \u201915, pp. 167\u2013174. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2676724.2693177","DOI":"10.1145\/2676724.2693177"},{"key":"12_CR14","unstructured":"Grenrus, O.: Fix-ing regular expressions (2020). https:\/\/well-typed.com\/blog\/2020\/06\/fix-ing-regular-expressions\/. Accessed 16 Apr 2025"},{"key":"12_CR15","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 3rd edn., Pearson international edition. Addison-Wesley (2007)"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1017\/S0956796898003050","volume":"8","author":"G Hutton","year":"1998","unstructured":"Hutton, G., Meijer, E.: Monadic parsing in haskell. J. Funct. Program. 8(4), 437\u2013444 (1998). https:\/\/doi.org\/10.1017\/S0956796898003050","journal-title":"J. Funct. Program."},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Krishnaswami, N.R., Yallop, J.: A typed, algebraic approach to parsing. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, pp. 379\u2013393. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3314221.3314625","DOI":"10.1145\/3314221.3314625"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with derivatives: a functional pearl. In: Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP \u201911, pp. 189\u2013195. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/2034773.2034801","DOI":"10.1145\/2034773.2034801"},{"key":"12_CR19","unstructured":"Poiret, J., Escot, L., Ceulemans, J., Altenm\u00fcller, M., Nuyts, A.: Read the mode and stay positive. In: 29th International Conference on Types for Proofs and Programs, Valencia, Spain (2023)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-12107-4_15","volume-title":"Software Language Engineering","author":"A Schwerdfeger","year":"2010","unstructured":"Schwerdfeger, A., Van Wyk, E.: Verifiable parse table composition for deterministic parsing. In: van den Brand, M., Ga\u0161evi\u0107, D., Gray, J. (eds.) SLE 2009. LNCS, vol. 5969, pp. 184\u2013203. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12107-4_15"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-662-54458-7_15","volume-title":"Foundations of Software Science and Computation Structures","author":"P Thiemann","year":"2017","unstructured":"Thiemann, P.: Partial derivatives for context-free languages. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 248\u2013264. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_15"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Vinju, J.J.: Comparing bottom-up with top-down parsing architectures for the syntax definition formalism from a disambiguation standpoint. In: L\u00e4mmel, R., Mosses, P.D., Steimann, F. (eds.) Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), vol.\u00a0109, pp. 31:1\u201331:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2023). https:\/\/doi.org\/10.4230\/OASIcs.EVCS.2023.31","DOI":"10.4230\/OASIcs.EVCS.2023.31"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99751-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:22:09Z","timestamp":1764361329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99751-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031997501","9783031997518"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99751-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}