Explore >> Select a destination
|
You are here 
|
blog.thomasheartman.com | ||
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
kndrck.co
|
|
| | | | | Prelude State monads, introduced to me during the data61 functional programming course was one of my most memorable encounter with a monad. This was mainly because things only started to clicked and made a tiny bit of sense after a couple of weeks of frustration. This article is my attempt to explain the underlying mechanics of the State Monad to try and relief the frustration of whomever who was in my position. | |
| | | | |
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
|
|
| | | The bruijn programming language is pure lambda calculus with some syntactic improvements. It doesn't have any primitive functions - how is that possible? | ||
