News for hackers. Stuff that matters.
Re:Why is writing mathematical proofs more fault-proof than ... by hackermailman on Monday January 01, 2018 @04:16PM (#16048098)
Anybody interested, this 2016 paper is a general survey of the current proof logic refinement implementations out there, and the problems and limitations they have which they are currently trying to solve with dependent types/Computational Higher Type Theory http://www.redprl.org/pdfs/afpr.pdf

There are no comments on this comment yet.