Explore >> Select a destination
|
You are here 
|
studiofreya.org | ||
| | | | |
hermanschaaf.com
|
|
| | | | | Benchmarks of various approaches | |
| | | | |
jakewharton.com
|
|
| | | | | ||
| | | | |
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 | |
| | | | |
www.java-tv.com
|
|
| | | This video reveals the long lost secret of how to write readable Java code. Self explaining method names, fluent interfaces, DSLs, helpful frameworks... We are always looking for ways to make our code more readable. But in our quest, we seem to have forgotten something. The most effective way to make any code more readable. | ||
