Author:
Berger Ulrich,Miyamoto Kenji,Schwichtenberg Helmut,Seisenberger Monika
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Agda:
http://wiki.portal.chalmers.se/agda/
2. Berger, U., Berghofer, S., Letouzey, P., Schwichtenberg, H.: Program extraction from normalization proofs. Studia Logica 82, 27–51 (2006)
3. Applied Logic Series;H. Benl,1998
4. Berger, U., Buchholz, W., Schwichtenberg, H.: Refined program extraction from classical proofs. APAL 114, 3–25 (2002)
5. Lecture Notes in Computer Science;U. Berger,2009
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reasonable Agda is correct Haskell: writing verified Haskell using agda2hs;Proceedings of the 15th ACM SIGPLAN International Haskell Symposium;2022-09-06
2. Extracting total Amb programs from proofs;Programming Languages and Systems;2022
3. Extraction of a computer-certified ODE solver;2021 European Control Conference (ECC);2021-06-29
4. Intuitionistic fixed point logic;Annals of Pure and Applied Logic;2021-03
5. An Algorithmic Version of Zariski’s Lemma;Lecture Notes in Computer Science;2021