5 ms·
The Little Prover
- ketralnis 4y ago> Errata > Pages 165-166: replace all occurrences of "cheese" by "eggs" Love it
- siddboots 4y agoWe've all made that mistake before.
- javcasas 4y agoThis is a very good book that will teach you the basics of manipulating code in a correct way (correct as in mathematically correct, not in some nebulously ill-defined level of correctness). if-nest-a FTW!
- deleted 4y ago[deleted]
- Bilal_io 4y agoThe MIT Press URL says "Book not found..."
- Jtsummers 4y agohttps://mitpress.mit.edu/9780262330572/the-little-prover/ https://mitpress.mit.edu/9780262330572/the-little-prover/
- smaddox 4y agoAnother very small proof system: https://github.com/moonad/formcorejs https://github.com/moonad/formcorejs The core implementation is under 700 lines of JS, including the parser: https://github.com/moonad/FormCoreJS/blob/master/FormCore.js https://github.com/moonad/FormCoreJS/blob/master/FormCore.js The author has since moved on to building a runtime with optimal evaluation (https://github.com/kindelia/hvm https://github.com/kindelia/hvm) and a new proof language on top of that (https://github.com/Kindelia/Kind2 https://github.com/Kindelia/Kind2) with considerably better performance than existing proof systems.
- voxl 4y agoThe hype of Blockchain is an astounding thing, and the cascading hype for systems merely because they are based off people in the Blockchain space is equally as befuddling. Try https://github.com/AndrasKovacs/smalltt https://github.com/AndrasKovacs/smalltt if you want a system that considers the things modern systems care about: elaboration and unification.
- fspeech 4y agoI don't understand the allusion to block chains, but I do appreciate the link to smalltt.
- riku_iki 4y ago> The core implementation is under 700 lines of JS, why people implement such projects in exotic languages (haskell, JS), and not c/c++, so it can be used in much more wide usecases. Also, everyone tries to invent some new functional language, while core of prover can operate just first order logic (two quantifiers: exists and any), and on top of that others can build any kind of language to the taste.
- girvo 4y ago> and not c/c++, so it can be used in much more wide usecases. Because porting a small, simple Javascript library to other languages is typically very easy if you really need it, and C/C++ are a lot more of a pain to implement certain things in? And I say this as someone who is writing C/C++ (and Nim) daily for work. If it is a teaching exercise: more people know Javascript than they know C and C++, and there are numerous high-quality provers in C/C++ already that one can use if it's for actual usage, and not just learning. There are plenty of reasons.
- riku_iki 4y ago> Because porting a small, simple Javascript library to other languages is typically very easy if you really need it I want to use some prover lib in my Java/C#/Py code. I can wrap jni API for existing C++ library, or maybe original author already built such wrapper for popular language. And you propose me instead to go and reverse engineer library Js code which I am not that proficient in, and rewrite all code in Java instead?.. > and C/C++ are a lot more of a pain to implement certain things in? this is challengeable. > more people know Javascript than they know C and C++ this people do UI, and usually not interested in utilizing prover. > and there are numerous high-quality provers in C/C++ already that one can use if it's for actual usage For example?
- alecco 4y agoThere's a nice Corecursive podcast episode with the authors about their last book. https://corecursive.com/023-little-typer-and-pie-language/ https://corecursive.com/023-little-typer-and-pie-language/
- worldsayshi 4y agoAre there any suggesters built on top of these proof assistants that have been suggested recently? Like code completion engines but for proofs?
- worldsayshi 4y agoAlso, has anyone tried building a puzzle game using a proof assistant?
- gmfawcett 4y agoI'm pretty sure that Coq is a puzzle game itself, masquerading as a proof assistant!
- schoen 4y agoI've used Z3 to create some logic puzzles, but I was using the SAT solver features rather than the proof features. One effective, if naive, approach to determining whether a logic puzzle has a unique solution is checking: * is my current constraint set satisfiable? * if so, exhibit a satisfying assignment ("foo") * add a new constraint that explicitly excludes the solution "foo" * is the resulting constraint set satisfiable? * if not, great! (the solution "foo" is unique)
- abecedarius 4y agohttps://www.ma.imperial.ac.uk/~buzzard/xena/natural_number_game/ https://www.ma.imperial.ac.uk/~buzzard/xena/natural_number_g... You could go further towards it feeling like a game, yes -- I've been wanting that too. I'm still learning the basics of these things.
- schoen 4y agoBefore playing the Natural Number Game, I played the Incredible Proof Machine: http://incredible.pm/ http://incredible.pm/ It's fun! Admittedly the diagrams tend to explode in size for complicated proofs.
- zaik 4y ago