bor0
You should try my (esoteric) programming language (theorem prover), Budge-TP :)
You might find useful my recent write-up about https://bor0.wordpress.com/2023/02/05/writing-your-third-pro...
> Anyone know if there's a decent way to get a printed copy?
I decided to re-publish the book with Apress, and it should be ready for print by March this year.
> How is it better than tdd in Idris book?
I would not say it is better, or worse. I read TDD and it's a great book, but it was mostly focused on practical stuff (i.e. programming in Idris), and I found it lacking the theoretical explanations (for example, what proofs are and how to do a mathematical proof, or what is a type-checker and how to implement one) which I hoped to cover in my book.
$ ls /dev/null /dev/full
ls: /dev/full: No such file or directory
/dev/null
I guess in theory, you can imitate `/dev/full` by other means.Algorithmic Puzzle: Continuous Increasing Subsequences
Capturing Number Theory in Haskell
But love? Love taught me things I couldn't imagine (in a positive way).
Towards Hoare logic for a small imperative language in Haskell
> avoid success at all costs
According to that statement, to me it seems that the current "success" (however one defines it) of Haskell is just a side-effect.
Yes, it is used in industry, but I believe the bigger impact here is how other languages "steal" features from it.
Haskell Memoization and Evaluation Model
Proof: One Sunday every 7 days
A simple Constraint Programming implementation
Superliminal Game Overview
Proofs and Computation with Trees
> but it's not really what it claims to be at all
I agree that the content may be interesting (only) to Coq newcomers, but I disagree with the quoted statement.
If you extract the code to Haskell e.g., and put some IO handling you basically have a line editor.
> the length of the paper almost halves and the amount of substance becomes clearer
Thank you for this. I can amend it in a future version once I get more/other comments on the paper.
I just wanted to get my message across and learn something on the way. It also sells relatively well, but that is a side-effect of my initial intentions :)
Deriving a Quine in a Lisp
Equational Reasoning in Racket
I blog about math and programming. It is a random collection but mostly (but not only) functional programming, formal verification.
Encoding probability and random variables in Racket
Can you elaborate on that statement? To me, it implies that going with Haskell avoids success, but I might be missing something. If that really is the implication, can you explain?
Stay Home
I guess this is similar to spaced repetition.