pdf-format: |
|
@InProceedings{forster_et_al:LIPIcs:2019:11072, author = {Yannick Forster and Fabian Kunze}, title = {{A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {17:1--17:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {John Harrison and John O'Leary and Andrew Tolmach}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11072}, URN = {urn:nbn:de:0030-drops-110724}, doi = {10.4230/LIPIcs.ITP.2019.17}, annote = {Keywords: call-by-value, lambda calculus, Coq, constructive type theory, extraction, computability} }
Keywords: | call-by-value, lambda calculus, Coq, constructive type theory, extraction, computability | |
Seminar: | 10th International Conference on Interactive Theorem Proving (ITP 2019) | |
Issue date: | 2019 | |
Date of publication: | 05.09.2019 | |
Supplementary Material: | The Coq development is accessible at https://github.com/uds-psl/certifying-extraction-with-time-bounds. |