{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:30Z","timestamp":1750309590519,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,26]]},"DOI":"10.1145\/3723325.3723338","type":"proceedings-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T10:54:18Z","timestamp":1746183258000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Context-Free Binding Grammars"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1403-2129","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"L\u00f6tters","sequence":"first","affiliation":[{"name":"MNI, Technische Hochschule Mittelhessen, Giessen, Hessen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0216-8803","authenticated-orcid":false,"given":"Uwe","family":"Meyer","sequence":"additional","affiliation":[{"name":"MNI, Technische Hochschule Mittelhessen, Giessen, Hessen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Annika Aasa. 1995. Precedences in specifications and implementations of programming languages. Theoretical Computer Science 142 1 (1995) 3\u201326. https:\/\/doi.org\/10.1016\/0304-3975(95)90680-J Selected Papers of the Symposium on Programming Language Implementation and Logic Programming.","DOI":"10.1016\/0304-3975(95)90680-J"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Alfred\u00a0V. Aho. 1968. Indexed Grammars\u2014An Extension of Context-Free Grammars. J. ACM 15 4 (oct 1968) 647\u2013671. https:\/\/doi.org\/10.1145\/321479.321488","DOI":"10.1145\/321479.321488"},{"key":"e_1_3_3_2_4_2","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt Hendrik\u00a0Pieter","year":"1984","unstructured":"Hendrik\u00a0Pieter Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics. Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., New York, N.Y."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_65"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Arthur Chargu\u00e9raud. 2012. The Locally Nameless Representation. Journal of Automated Reasoning 49 (10 2012) 1\u201346. https:\/\/doi.org\/10.1007\/s10817-011-9225-2","DOI":"10.1007\/s10817-011-9225-2"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Noam Chomsky. 1959. On certain formal properties of grammars. Information and Control 2 2 (1959) 137\u2013167. https:\/\/doi.org\/10.1016\/S0019-9958(59)90362-6","DOI":"10.1016\/S0019-9958(59)90362-6"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"N.G. de Bruijn. 1972. Lambda calculus notation with nameless dummies a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae (Proceedings) 75 5 (1972) 381\u2013392. https:\/\/doi.org\/10.1016\/1385-7258(72)90034-0","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_26"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1013963.1013978"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Murdoch\u00a0J. Gabbay and Andrew\u00a0M. Pitts. 2002. A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing 13 3\u20135 (July 2002) 341\u2013363. https:\/\/doi.org\/10.1007\/s001650200016","DOI":"10.1007\/s001650200016"},{"key":"e_1_3_3_2_12_2","unstructured":"Jean-Yves Girard. 1972. Interpr\u00e9tation fonctionnelle et \u00e9limination des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur. Ph.\u00a0D. Dissertation. Universit\u00e9 Paris-Diderot Paris France."},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/3002812"},{"key":"e_1_3_3_2_14_2","unstructured":"Bastiaan Heeren. 2005. Top quality type error Messages. Ph.\u00a0D. Dissertation. Utrecht University Utrecht Netherlands."},{"key":"e_1_3_3_2_15_2","volume-title":"Introduction to Automata Theory, Languages, and Computation (3rd Edition)","author":"Hopcroft John\u00a0E.","year":"2006","unstructured":"John\u00a0E. Hopcroft, Rajeev Motwani, and Jeffrey\u00a0D. Ullman. 2006. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., USA."},{"key":"e_1_3_3_2_16_2","first-page":"69","volume-title":"Tree-Adjoining Grammars","author":"Joshi Aravind\u00a0K.","year":"1997","unstructured":"Aravind\u00a0K. Joshi and Yves Schabes. 1997. Tree-Adjoining Grammars. Springer Berlin Heidelberg, Berlin, Heidelberg, 69\u2013123. https:\/\/doi.org\/10.1007\/978-3-642-59126-6_2"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Donald\u00a0E. Knuth. 1968. Semantics of context-free languages. Mathematical systems theory 2 2 (01 Jun 1968) 127\u2013145. https:\/\/doi.org\/10.1007\/BF01692511","DOI":"10.1007\/BF01692511"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-74558-4_6"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Robin Milner. 1978. A theory of type polymorphism in programming. J. Comput. System Sci. 17 3 (1978) 348\u2013375. https:\/\/doi.org\/10.1016\/0022-0000(78)90014-4","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_3_2_20_2","unstructured":"Ulf Norell. 2007. Towards a practical programming language based on dependent type theory. Ph.\u00a0D. Dissertation. Chalmers University of Technology and G\u00f6teborg University Gothenburg Sweden."},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Fernando C.\u00a0N. Pereira and David H.\u00a0D. Warren. 1980. Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence 13 3 (1980) 231\u2013278. https:\/\/doi.org\/10.1016\/0004-3702(80)90003-X","DOI":"10.1016\/0004-3702(80)90003-X"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54010"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Aarne Ranta. 2004. Grammatical Framework. Journal of Functional Programming 14 2 (2004) 145\u2013189. https:\/\/doi.org\/10.1017\/S0956796803004738","DOI":"10.1017\/S0956796803004738"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06859-7_148"},{"key":"e_1_3_3_2_25_2","volume-title":"Coq: The Interactive Theorem Prover","author":"Team The\u00a0Coq","year":"2025","unstructured":"The\u00a0Coq Team. 2025. Coq: The Interactive Theorem Prover. INRIA. https:\/\/coq.inria.fr (visited on 2025-03-06)."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1389449.1389465"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51054-1_10"},{"key":"e_1_3_3_2_28_2","unstructured":"David\u00a0Jeremy Weir. 1988. Characterizing mildly context-sensitive grammar formalisms. Ph.\u00a0D. Dissertation. University of Pennsylvania Philadelphia Pennsylvania USA."},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034818"}],"event":{"name":"IFL 2024: Proceedings of the 36th Symposium on Implementation and Application of Functional Languages","acronym":"IFL 2024","location":"Nijmegen Netherlands"},"container-title":["Proceedings of the 36th Symposium on Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723325.3723338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3723325.3723338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:56:48Z","timestamp":1750298208000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723325.3723338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":28,"alternative-id":["10.1145\/3723325.3723338","10.1145\/3723325"],"URL":"https:\/\/doi.org\/10.1145\/3723325.3723338","relation":{},"subject":[],"published":{"date-parts":[[2024,8,26]]},"assertion":[{"value":"2025-05-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}