Mark Bickford

Available identifiers

Publication	Date of Publication	Type
Efficient Algorithms from Proofs in Constructive Analysis	2023-08-11	Paper
Formalizing Moessner's theorem and generalizations in \textsc{Nuprl}	2021-11-24	Paper
Computability beyond Church-Turing via choice sequences	2021-01-20	Paper
Bar induction. The good, the bad, and the ugly	2021-01-19	Paper
Connectedness of the continuum in intuitionistic mathematics	2020-05-11	Paper
Bar induction is compatible with constructive type theory	2019-11-21	Paper
A verified theorem prover backend supported by a monotonic library	2019-07-04	Paper
Implementing Euclid's straightedge and compass constructions in type theory	2019-05-16	Paper
Validating Brouwer's continuity principle for numbers using named exceptions	2018-05-17	Paper
Vladimir Voevodsky -- work and destiny	2018-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q4981439	2014-06-24	Paper
Intuitionistic completeness of first-order logic	2014-01-13	Paper
Formal program optimization in Nuprl using computational equivalence and partial types	2013-08-07	Paper
Knowledge-based synthesis of distributed systems using event structures	2011-05-26	Paper
Innovations in computational type theory using Nuprl	2007-02-20	Paper
Logic for Programming, Artificial Intelligence, and Reasoning	2005-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4790655	2003-02-04	Paper
https://portal.mardi4nfdi.de/entity/Q4037115	1993-05-18	Paper

This page was built for person: Mark Bickford