Explore >> Select a destination
|
You are here 
|
www.idris-lang.org | ||
| | | | |
sookocheff.com
|
|
| | | | | In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: | |
| | | | |
text.marvinborner.de
|
|
| | | | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | |
| | | | |
www.type-driven.org.uk
|
|
| | | | | ||
| | | | |
128bit.io
|
|
| | | So, it was time for a bit of change for the blog. I have been using an older version of Jekyll for some time and upgrading for me has always been a pain. I picked to move away from Jekyll to something new, this is where Hugo comes into play. Hugo Hugo is another static site generator like Jekyll but written in Go, it boasts itself as the fastest tool of its kind but it wasn't the speed that drew me to it. | ||
