受强制性开放获取政策约束的文章 - Mark Bickford了解详情
无法在其他位置公开访问的文章：1 篇
Implementing Euclid’s straightedge and compass constructions in type theory
A Kellison, M Bickford, R Constable
Annals of Mathematics and Artificial Intelligence 85, 175-192, 2019
强制性开放获取政策： US National Science Foundation
可在其他位置公开访问的文章：6 篇
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems
V Rahli, D Guaspari, M Bickford, RL Constable
Science of Computer Programming 148, 26-48, 2017
强制性开放获取政策： US Department of Defense, Luxembourg National Research Fund
Validating Brouwer's continuity principle for numbers using named exceptions
V Rahli, M Bickford
Mathematical Structures in Computer Science 28 (6), 942-990, 2018
强制性开放获取政策： Luxembourg National Research Fund
Computability beyond church-turing via choice sequences
M Bickford, L Cohen, RL Constable, V Rahli
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
强制性开放获取政策： Luxembourg National Research Fund
Bar induction is compatible with constructive type theory
V Rahli, M Bickford, L Cohen, RL Constable
Journal of the ACM (JACM) 66 (2), 1-35, 2019
强制性开放获取政策： Luxembourg National Research Fund
A verified theorem prover backend supported by a monotonic library
V Rahli, L Cohen, M Bickford
LOGIC PROGRAMMING AND AUTOMATED REASONING, 2018
强制性开放获取政策： US National Science Foundation, Luxembourg National Research Fund
Connectedness of the continuum in intuitionistic mathematics
M Bickford
Mathematical Logic Quarterly 64 (4-5), 387-394, 2018
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定