Universality of proofs
暂无分享,去创建一个
[1] Brigitte Pientka,et al. Inductive Beluga: Programming Proofs , 2015, CADE.
[2] Amy P. Felty,et al. The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations , 2015, Journal of Automated Reasoning.
[3] Claus Zinn,et al. Understanding informal mathematical discourse , 2004 .
[4] Amy P. Felty,et al. An Open Challenge Problem Repository for Systems Supporting Binders , 2015, LFMTP.
[5] Cezary Kaliszyk,et al. Learning to Parse on Aligned Corpora (Rough Diamond) , 2015, ITP.
[6] Brigitte Pientka,et al. Programming with binders and indexed data-types , 2012, POPL '12.
[7] Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions , 2008, POPL '08.
[8] Cezary Kaliszyk,et al. Formal Mathematics on Display: A Wiki for Flyspeck , 2013, MKM/Calculemus/DML.
[9] Cezary Kaliszyk,et al. Learning-Assisted Automated Reasoning with Flyspeck , 2012, Journal of Automated Reasoning.
[10] Brigitte Pientka,et al. A Case Study on Logical Relations using Contextual Types , 2015, LFMTP.