{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:13:51Z","timestamp":1742955231527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948201"},{"type":"electronic","value":"9783319948218"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94821-8_17","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:25:55Z","timestamp":1530624355000},"page":"289-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reification by Parametricity"],"prefix":"10.1007","author":[{"given":"Jason","family":"Gross","sequence":"first","affiliation":[]},{"given":"Andres","family":"Erbsen","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Chlipala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"17_CR1","unstructured":"Anand, A., Boulier, S., Tabareau, N., Sozeau, M.: Typed Template Coq. CoqPL 2018, January 2018. \n                    https:\/\/popl18.sigplan.org\/event\/coqpl-2018-typed-template-coq"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BFb0014565","volume-title":"Theoretical Aspects of Computer Software","author":"S Boutin","year":"1997","unstructured":"Boutin, S.: Using reflection to build efficient and certified decision procedures. In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol. 1281, pp. 515\u2013529. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/BFb0014565"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"de Bruijn, N.G.: Lambda-calculus notation with nameless dummies: a tool for automatic formal manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae (Proceedings) 34(5), 381\u2013392 (1972). \n                    https:\/\/doi.org\/10.1016\/1385-7258(72)90034-0\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/1385725872900340","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chlipala, A.: Parametric higher-order abstract syntax for mechanized semantics. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, September 2008. \n                    http:\/\/adam.chlipala.net\/papers\/PhoasICFP08\/","DOI":"10.1145\/1411204.1411226"},{"key":"17_CR5","unstructured":"Coq Development Team: The Coq Proof Assistant Reference Manual, chap. 10.3 Detailed examples of tactics (quote). INRIA, 8.7.1 edn. (2017). \n                    https:\/\/coq.inria.fr\/distrib\/V8.7.1\/refman\/tactic-examples.html#quote-examples"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Erbsen, A., Philipoom, J., Gross, J., Sloan, R., Chlipala, A.: Simple high-level code for cryptographic arithmetic - with proofs, without compromises. In: Proceedings of IEEE Symposium on Security & Privacy, May 2019","DOI":"10.1109\/SP.2019.00005"},{"key":"17_CR7","unstructured":"Gonthier, G., Mahboubi, A., Tassi, E.: A small scale reflection extension for the Coq system. Technical report, Inria Saclay Ile de France, November 2016. \n                    https:\/\/hal.inria.fr\/inria-00258384\/"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Gonthier, G., Ziliani, B., Nanevski, A., Dreyer, D.: How to make ad hoc proof automation less ad hoc. J. Funct. Programm. 23(4), 357\u2013401 (2013). \n                    https:\/\/doi.org\/10.1017\/S0956796813000051\n                    \n                  . \n                    https:\/\/people.mpi-sws.org\/~beta\/lessadhoc\/lessadhoc-extended.pdf","DOI":"10.1017\/S0956796813000051"},{"key":"17_CR9","unstructured":"Malecha, G., Chlipala, A., Braibant, T.: Compositional computational reflection. In: Proceedings of the 5th International Conference on Interactive Theorem Proving, ITP 2014 (2014). \n                    http:\/\/adam.chlipala.net\/papers\/MirrorShardITP14\/"},{"key":"17_CR10","unstructured":"P\u00e9drot, P.M.: Fast REL lookup #6506, December 2017. \n                    https:\/\/github.com\/coq\/coq\/pull\/6506"},{"key":"17_CR11","unstructured":"Pfenning, F., Elliot, C.: Higher-order abstract syntax. In: Proceedings of PLDI, pp. 199\u2013208 (1988). \n                    https:\/\/www.cs.cmu.edu\/~fp\/papers\/pldi88.pdf"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Sozeau, M., Oury, N.: First-class type classes. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278\u2013293. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-71067-7_23\n                    \n                  . \n                    https:\/\/www.irif.fr\/~sozeau\/research\/publications\/","DOI":"10.1007\/978-3-540-71067-7_23"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94821-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T13:47:27Z","timestamp":1578491247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94821-8_17"}},"subtitle":["Fast Setup for Proof by Reflection, in Two Lines of Ltac"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948201","9783319948218"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94821-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ITP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Interactive Theorem Proving","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/itp2018.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}