{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:11:32Z","timestamp":1770289892595,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319214009","type":"print"},{"value":"9783319214016","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21401-6_18","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T10:13:46Z","timestamp":1437732826000},"page":"272-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Inductive Beluga: Programming Proofs"],"prefix":"10.1007","author":[{"given":"Brigitte","family":"Pientka","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Cave","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-03545-1_16","volume-title":"Certified Programs and Proofs","author":"O Savary-Belanger","year":"2013","unstructured":"Savary-Belanger, O., Monnier, S., Pientka, B.: Programming type-safe transformations using higher-order abstract syntax. In: Gonthier, G., Norrish, M. (eds.) CPP 2013. LNCS, vol. 8307, pp. 243\u2013258. Springer, Heidelberg (2013)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cave, A., Pientka, B.: Programming with binders and indexed data-types. In: 39th Annual ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2012), pp. 413\u2013424. ACM Press (2012)","DOI":"10.1145\/2103656.2103705"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cave, A., Pientka, B.: First-class substitutions in contextual type theory. In: 8th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2013), pp. 15\u201324. ACM Press (2013)","DOI":"10.1145\/2503887.2503889"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Dunfield, J., Pientka, B.: Case analysis of higher-order data. In: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2008), Electronic Notes in Theoretical Computer Science (ENTCS 228), pp. 69\u201384. Elsevier (2009)","DOI":"10.1016\/j.entcs.2008.12.117"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Felty, A.P., Momigliano, A., Pientka, B.: The next 700 Challenge Problems for Reasoning with Higher-order Abstract Syntax Representations: Part 2 - a Survey. Journal of Automated Reasoning (2015)","DOI":"10.1007\/s10817-015-9327-3"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira, F., Pientka, B.: Bidirectional elaboration of dependently typed languages. In: 16th International Symposium on Principles and Practice of Declarative Programming (PPDP 2014). ACM (2014)","DOI":"10.1145\/2643135.2643153"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-71070-7_13","volume-title":"Automated Reasoning","author":"A Gacek","year":"2008","unstructured":"Gacek, A.: The abella interactive theorem prover (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 154\u2013161. Springer, Heidelberg (2008)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gacek, A., Miller, D., Nadathur, G.: Combining generic judgments with recursive definitions. In: 23rd Symposium on Logic in Computer Science. IEEE Computer Society Press (2008)","DOI":"10.1109\/LICS.2008.33"},{"key":"18_CR10","volume-title":"Proofs and Types","author":"J-Y Girard","year":"1990","unstructured":"Girard, J.-Y., Lafont, Y., Tayor, P.: Proofs and Types. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. J. ACM 40(1), 143\u2013184 (1993)","journal-title":"J. ACM"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-58085-9_78","volume-title":"TYPES: Types for Proofs and Programs","author":"L Magnusson","year":"1994","unstructured":"Magnusson, L., Nordstr\u00f6m, B.: The Alf proof editor and its proof engine. In: Barendregt, Henk, Nipkow, Tobias (eds.) TYPES: Types for Proofs and Programs. (LNCS 806), vol. 806, pp. 213\u2013237. Springer, Heidelberg (1994)"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1352582.1352591","volume":"9","author":"A Nanevski","year":"2008","unstructured":"Nanevski, A., Pfenning, F., Pientka, B.: Contextual modal type theory. ACM Trans. Comput. Logic 9(3), 1\u201349 (2008)","journal-title":"ACM Trans. Comput. Logic"},{"key":"18_CR14","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D thesis, Department of Computer Science and Engineering, Chalmers University of Technology, September 2007. Technical Report 33D"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf - a meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Pientka, B.: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In: 35th Annual ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2008), pp. 371\u2013382. ACM Press (2008)","DOI":"10.1145\/1328438.1328483"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796812000408","volume":"23","author":"B Pientka","year":"2013","unstructured":"Pientka, B.: An insider\u2019s look at LF type reconstruction: Everything you (n)ever wanted to know. J. Funct. Program. 23(1), 1\u201337 (2013)","journal-title":"J. Funct. Program."},{"key":"18_CR18","unstructured":"Pientka, B., Abel, A.: Structural recursion over contextual objects, In: 13th Typed Lambda Calculi and Applications (TLCA 2015), LIPIcs-Leibniz International Proceedings in Informatics (2015)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-14203-1_2","volume-title":"Automated Reasoning","author":"B Pientka","year":"2010","unstructured":"Pientka, B., Dunfield, J.: Beluga: a framework for programming and reasoning with deductive systems (System Description). In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 15\u201321. Springer, Heidelberg (2010)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.2307\/2271658","volume":"32","author":"W Tait","year":"1967","unstructured":"Tait, W.: Intensional Interpretations of Functionals of Finite Type I. J. Symb. Log. 32(2), 198\u2013212 (1967)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-25"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21401-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:46:18Z","timestamp":1676972778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21401-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214009","9783319214016"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21401-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}