/explore
|
You are here 
|
studiofreya.org | ||
| | | | |
blog.tst.sh
Llama is a language that compiles directly to lambda calculus with almost no layer of abstraction Example This code successfully compiles to: (?mkpair.(?first.(?getfirst.(?second.(?getsecond.(?concat.(?map.(?succ.(?pred.(?mult.(?owo.(?wew.concat (concat (map owo succ) " ") (map wew succ)) "Vgdqk ") "Gdmkn+") ?m n f x.m (n |
|
| | | | | ||
| | | | |
fernandocorreia.dev
This is part 13 of my journey learning Golang. Strings in Go Strings represent a sequence of bytes. More specifically, a read-only slice of uint8 integers. ... |
|
| | | | | ||
| | | | |
hermanschaaf.com
Benchmarks of various approaches |
|
| | | | | ||
| | | | |
crawshaw.io
[AI summary] A technical analysis of the limitations and potential use cases for finalizers in Go's garbage collection system. |
|
| | | |||
