pi-base, a database of topological spaces
https://topology.jdabbs.com/
https://topology.jdabbs.com/
π-Base
A community database of topological theorems and spaces, with powerful search and automated proof deduction.
Pure & constructive mathematics in theory and use
Same question, but based on data only gained here
Mercury and Idris, it will be. Stay tuned!
What does a humped critter have to teach us?
https://markkarpov.com/post/what-does-a-humped-critter-have-to-teach-us.html
https://markkarpov.com/post/what-does-a-humped-critter-have-to-teach-us.html
Markkarpov
What does a humped critter have to teach us?
A Coq framework to support implementing, specifying, verifying, and compiling Bluespec-style hardware components with high developer productivity.
http://plv.csail.mit.edu/kami/
http://plv.csail.mit.edu/kami/
Parallel & Distributed Operating Systems Group
https://pdos.csail.mit.edu/
https://pdos.csail.mit.edu/
pdos.csail.mit.edu
MIT CSAIL Parallel and Distributed Operating Systems Group
MIT CSAIL Parallel and Distributed Operating Systems homepage
You are already smart enough to write Haskell
https://williamyaoh.com/posts/2019-10-05-you-are-already-smart-enough.html
https://williamyaoh.com/posts/2019-10-05-you-are-already-smart-enough.html
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and MonadS
https://www.dpmms.cam.ac.uk/~martin/Research/Publications/2007/hp07.pdf
https://www.dpmms.cam.ac.uk/~martin/Research/Publications/2007/hp07.pdf
A Course in Universal Algebra
http://www.math.uwaterloo.ca/~snburris/htdocs/ualg.html
http://www.math.uwaterloo.ca/~snburris/htdocs/ualg.html
Proofs by contradiction, versus contradiction proofs
https://existentialtype.wordpress.com/2017/03/04/a-proof-by-contradiction-is-not-a-proof-that-derives-a-contradiction/
https://existentialtype.wordpress.com/2017/03/04/a-proof-by-contradiction-is-not-a-proof-that-derives-a-contradiction/
Reflections on Standard ML
http://sml-family.org/papers/MacQueen-reflections.pdf
Standard ML is one of a number of new programming languages developed in the 1980s that are seen as suitable vehicles for serious systems and applications programming. It offers an excellent ratio of expressiveness to language complexity, and provides competitive efficiency. Because of its type and module system, Standard ML manages to combine safety, security, and robustness with much of the flexibility of dynamically typed languages like Lisp. It is also has the most well-developed scientific foundation of any major language. Here I review the strengths and weaknesses of Standard ML and describe some of what we have learned through the design, implementation, and use of the language.
http://sml-family.org/papers/MacQueen-reflections.pdf
