{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:27:04Z","timestamp":1743110824048,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030162016"},{"type":"electronic","value":"9783030162023"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16202-3_2","type":"book-chapter","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:04:08Z","timestamp":1552626248000},"page":"18-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Code Generation for Higher Inductive Types"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9593-0627","authenticated-orcid":false,"given":"Paventhan","family":"Vivekanandan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,16]]},"reference":[{"key":"2_CR1","unstructured":"Agda\u2019s Documentation (2018). \n                      http:\/\/agda.readthedocs.io\/en\/latest\/language\/reflection.html"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers: constructing strictly positive types. Theor. Comput. Sci. 342(1), 3\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","unstructured":"Altenkirch, T.: Containers in homotopy type theory, talk at Mathematical Structures of Computation, January 2014"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-76786-2_4","volume-title":"Datatype-Generic Programming","author":"T Altenkirch","year":"2007","unstructured":"Altenkirch, T., McBride, C., Morris, P.: Generic programming with dependent types. In: Backhouse, R., Gibbons, J., Hinze, R., Jeuring, J. (eds.) SSDGP 2006. LNCS, vol. 4719, pp. 209\u2013257. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-76786-2_4"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Angiuli, C., Harper, R., Wilson, T.: Computational higher-dimensional type theory. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL, Paris, France, pp. 680\u2013693, January 2017","DOI":"10.1145\/3093333.3009861"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Angiuli, C., Morehouse, E., Licata, D.R., Harper, R.: Homotopical patch theory. In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, ICFP, Gothenburg, Sweden, September 2014","DOI":"10.1145\/2628136.2628158"},{"issue":"1","key":"2_CR7","first-page":"63","volume":"23","author":"H Basold","year":"2017","unstructured":"Basold, H., Geuvers, H., van der Weide, N.: Higher inductive types in programming. J. Univ. Comput. Sci. 23(1), 63\u201388 (2017)","journal-title":"J. Univ. Comput. Sci."},{"key":"2_CR8","unstructured":"Brunerie, G.: Custom definitional equalities in agda, talk at Univalent Foundations and Proof Assistants session of the 5th International Congress on Mathematical Software, July 2016"},{"key":"2_CR9","unstructured":"Cavallo, E., Harper, R.: Computational higher type theory iv: inductive types, July 2018. \n                      arXiv:1801.01568"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chapman, J., \u00c9variste Dagand, P., McBride, C., Morris, P.: The gentle art of levitation. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP, Baltimore, USA, September 2010","DOI":"10.1145\/1863543.1863547"},{"key":"2_CR11","unstructured":"Christiansen, D.: Practical reflection and metaprogramming for dependent types. Ph.D. thesis, IT University of Copenhagen (2016)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Christiansen, D., Brady, E.: Elaborator reflection: extending Idris in Idris. In: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP, Nara, Japan, September 2016","DOI":"10.1145\/2951913.2951932"},{"key":"2_CR13","unstructured":"Cockx, J., Abel, A.: Sprinkles of extensionality for your vanilla type theory. In: 22nd International Conference on Types for Proofs and Programs, May 2016"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Cockx, J., Devriese, D., Piessens, F.: Pattern matching without K. In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, ICFP, Gothenburg, Sweden, pp. 257\u2013268, September 2014","DOI":"10.1145\/2692915.2628139"},{"key":"2_CR15","unstructured":"Cohen, C., Coquand, T., Huber, S., M\u00f6rtberg, A.: Cubical type theory: a constructive interpretation of the univalence axiom. In: Proceedings of the 21st International Conference on Types for Proofs and Programs, Tallinn, Estonia, May 2015"},{"key":"2_CR16","unstructured":"Coquand, T., Huber, S., M\u00f6rtberg, A.: On higher inductive types in cubical type theory (2018). \n                      arXiv:1802.01170"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.entcs.2018.03.019","volume":"336","author":"P Dybjer","year":"2018","unstructured":"Dybjer, P., Moeneclaey, H.: Finitary higher inductive types in the groupoid model. Electro. Notes Theor. Comput. Sci. 336, 119\u2013134 (2018)","journal-title":"Electro. Notes Theor. Comput. Sci."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Ebner, G., Ullrich, S., Roesch, J., Avigad, J., de Moura, L.: A metaprogramming framework for formal verification. In: Proceedings of the 22nd ACM SIGPLAN International Conference on Functional Programming, ICFP, September 2017","DOI":"10.1145\/3110278"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kaposi, A., Kov\u00e1cs, A.: A syntax for higher inductive-inductive types. In: Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, FSCD, Oxford, UK, July 2018","DOI":"10.1145\/3290315"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-19797-5_14","volume-title":"Mathematics of Program Construction","author":"P Kokke","year":"2015","unstructured":"Kokke, P., Swierstra, W.: Auto in agda. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 276\u2013301. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-19797-5_14"},{"key":"2_CR21","unstructured":"Lumsdaine, P.L., Shulman, M.: Semantics of higher inductive types, May 2017. \n                      arXiv:1705.07088"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"L\u00f6h, A., Magalh\u00e3es, J.P.: Generic programming with indexed functors. In: Proceedings of the 7th ACM SIGPLAN Workshop on Generic Programming, WGP, September 2011","DOI":"10.1145\/2036918.2036920"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.entcs.2013.09.018","volume":"298","author":"S Mimram","year":"2013","unstructured":"Mimram, S., Giusto, C.D.: A categorical theory of patches. Electron. Notes Theor. Comput. Sci. 298, 283\u2013307 (2013)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR24","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Chalmers University of Technology, G\u00f6teborg, Sweden (2007)"},{"key":"2_CR25","unstructured":"Pelayo, A., Warren, M.: Homotopy type theory and Voevodsky\u2019s univalent foundations, October 2012. \n                      arXiv:1210.5658"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C.M., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles, SOSP, Cascais, Portugal (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Roundy, D.: Darcs: distributed version management in haskell. In: Proceedings of the 2005 ACM SIGPLAN Workshop on Haskell, September 2005","DOI":"10.1145\/1088348.1088349"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4204\/EPTCS.106.4","volume":"106","author":"J Stutterheim","year":"2013","unstructured":"Stutterheim, J., Swierstra, W., Swierstra, S.D.: Forty hours of declarative programming: teaching prolog at the junior college utrecht. Electron. Proc. Theor. Comput. Sci. 106, 50\u201362 (2013)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"2_CR29","unstructured":"The Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study (2013). \n                      https:\/\/homotopytypetheory.org\/book"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Vivekanandan, P.: HoTT-Crypt: a study in homotopy type theory based on cryptography. In: Short Paper proceedings of the 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-22, Ethiopia, November 2018. \n                      https:\/\/doi.org\/10.29007\/tvpp","DOI":"10.29007\/tvpp"},{"key":"2_CR31","unstructured":"van der Walt, P.: Reflection in agda. Master\u2019s thesis. Utrecht University, Utrecht, Netherlands (2012)"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-41582-1_10","volume-title":"Implementation and Application of Functional Languages","author":"P Walt van der","year":"2013","unstructured":"van der Walt, P., Swierstra, W.: Engineering proof by reflection in agda. In: Hinze, R. (ed.) IFL 2012. LNCS, vol. 8241, pp. 157\u2013173. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-41582-1_10"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16202-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:54:58Z","timestamp":1558342498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16202-3_2"}},"subtitle":["A Study in Agda Metaprogramming"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030162016","9783030162023"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16202-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WFLP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Functional and Constraint Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt\/Main","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","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":"wflp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ppdp-lopstr-18.cs.uni-frankfurt.de\/wflp18.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}