Explore >> Select a destination
|
You are here 
|
www.dawn-lang.org | ||
| | | | |
danilafe.com
|
|
| | | | | In this article, we use Coq to write down machine-checked semantics for the untyped concatenative calculus. | |
| | | | |
danilafe.com
|
|
| | | | | ||
| | | | |
text.marvinborner.de
|
|
| | | | | The bruijn programming language is pure lambda calculus with some syntactic improvements. It doesn't have any primitive functions - how is that possible? | |
| | | | |
dvt.name
|
|
| | | In the previous blog post in this series, we looked at Gödel's First Incompleteness Theorem, and came to the amazing conclusion that we can't compute certain kinds of functions in formal systems (like Javascript). Specifically, we looked at a special function, , which turned out to be non-computable. In case we forgot, the first incompleteness ... | ||
