{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T02:07:40Z","timestamp":1791598060374,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642133206","type":"print"},{"value":"9783642133213","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13321-3_6","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T06:24:11Z","timestamp":1277187851000},"page":"58-79","source":"Crossref","is-referenced-by-count":5,"title":["Dependently Typed Grammars"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Brink","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Holdermans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andres","family":"L\u00f6h","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_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, 323\u2013343 (1992)","journal-title":"Journal of Functional Programming"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-61628-4_7","volume-title":"Advanced Functional Programming","author":"S.D. Swierstra","year":"1996","unstructured":"Swierstra, S.D., Duponcheel, L.: Deterministic, error-correcting combinator parsers. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol.\u00a01129, pp. 184\u2013207. Springer, Heidelberg (1996)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-03153-3_6","volume-title":"Language Engineering and Rigorous Software Development","author":"S.D. Swierstra","year":"2009","unstructured":"Swierstra, S.D.: Combinator parsing: A short tutorial. In: Bove, A., Barbosa, L.S., Pardo, A., Pinto, J.S. (eds.) ALFA. LNCS, vol.\u00a05520, pp. 252\u2013300. Springer, Heidelberg (2009)"},{"key":"6_CR4","unstructured":"Leijen, D., Meijer, E.: Parsec: Direct style monadic parser combinator for the real world. Technical Report UU-CS-2001-035, Utrecht University (2001)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-04652-0_5","volume-title":"Advanced Functional Programming","author":"U. Norell","year":"2009","unstructured":"Norell, U.: Dependently typed programming in Agda. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol.\u00a05832, pp. 230\u2013266. Springer, Heidelberg (2009)"},{"key":"6_CR6","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Brink, K., Holdermans, S., L\u00f6h, A.: Dependently typed grammars, Agda code (2010), http:\/\/www.cs.uu.nl\/~andres\/DTG\/","DOI":"10.1007\/978-3-642-13321-3_6"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advanced Functional Programming","author":"J. Fokker","year":"1995","unstructured":"Fokker, J.: Functional parsers. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 1\u201323. Springer, Heidelberg (1995)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/SWAT.1970.5","volume-title":"Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory","author":"D.J. Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D.J., Lewis, P.M.: Deterministic left corner parsing. In: Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pp. 139\u2013152. IEEE, Los Alamitos (1970)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, M.: Finite-state approximation of constraint-based grammars using left-corner grammar transforms. In: COLING-ACL, pp. 619\u2013623 (1998)","DOI":"10.3115\/980451.980948"},{"key":"6_CR11","unstructured":"Baars, A.I., Swierstra, S.D., Viera, M.: Typed transformations of typed grammars: The left corner transform. To appear in the proceedings of the 9th Workshop on Language Descriptions, Tools and Applications (LDTA 2009), York, England (March 29, 2009)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0167-6423(99)00023-4","volume":"37","author":"J. Hughes","year":"2000","unstructured":"Hughes, J.: Generalising monads to arrows. Science of Computer Programming\u00a037, 67\u2013111 (2000)","journal-title":"Science of Computer Programming"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-540-30175-2_8","volume-title":"Generative Programming and Component Engineering","author":"E. Pas\u01celi\u0107","year":"2004","unstructured":"Pas\u01celi\u0107, E., Linger, N.: Meta-programming with typed object-language representations. In: Karsai, G., Visser, E. (eds.) GPCE 2004. LNCS, vol.\u00a03286, pp. 136\u2013167. Springer, Heidelberg (2004)"},{"key":"6_CR14","first-page":"15","volume-title":"Proceedings of TLDI\u201909: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation","author":"A.I. Baars","year":"2009","unstructured":"Baars, A.I., Swierstra, S.D., Viera, M.: Typed transformations of typed abstract syntax. In: Kennedy, A., Ahmed, A. (eds.) Proceedings of TLDI\u201909: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Savannah, GA, USA, January 24, pp. 15\u201326. ACM Press, New York (2009)"},{"key":"6_CR15","unstructured":"Danielsson, N.A., Norell, U.: Structurally recursive descent parsing (2008), http:\/\/www.cs.nott.ac.uk\/~nad\/publications\/danielsson-norell-parser-combinators.html"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Danielsson, N.A.: Total parser combinators (2009), http:\/\/www.cs.nott.ac.uk\/~nad\/publications\/danielsson-parser-combinators.html","DOI":"10.1145\/1863543.1863585"},{"key":"6_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44404-1_7","volume-title":"Logic for Programming and Automated Reasoning","author":"D. Delahaye","year":"2000","unstructured":"Delahaye, D.: A tactic language for the system Coq. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 85\u201395. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13321-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:52Z","timestamp":1606187092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13321-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642133206","9783642133213"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13321-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}