pdf-format: |
|
@InProceedings{forster_et_al:LIPIcs.ITP.2021.19, author = {Forster, Yannick and Kunze, Fabian and Smolka, Gert and Wuttke, Maximilian}, title = {{A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value \lambda-Calculus}}, booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-188-7}, ISSN = {1868-8969}, year = {2021}, volume = {193}, editor = {Cohen, Liron and Kaliszyk, Cezary}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13914}, URN = {urn:nbn:de:0030-drops-139142}, doi = {10.4230/LIPIcs.ITP.2021.19}, annote = {Keywords: formalizations of computational models, computability theory, Coq, time complexity, Turing machines, lambda calculus, Hoare logic} }
Keywords: | formalizations of computational models, computability theory, Coq, time complexity, Turing machines, lambda calculus, Hoare logic | |
Seminar: | 12th International Conference on Interactive Theorem Proving (ITP 2021) | |
Issue date: | 2021 | |
Date of publication: | 21.06.2021 | |
Supplementary Material: | Software (Code Repository): https://github.com/uds-psl/time-invariance-thesis-for-L archived at: https://archive.softwareheritage.org/swh:1:dir:cc13c3c6279985ae15903a24e23bd5d356b6f435 |