/explore
|
You are here 
|
thunderseethe.dev | ||
| | | | |
gilmi.me
|
|
| | | | | m.me - Giml's type inference engine | |
| | | | |
boxbase.org
|
|
| | | | | These ideas and thoughts have converged towards type theory, and I remembered familiar patterns so I did a closer study at the Hindley-Milner, to understand it much better than before. | |
| | | | |
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: | |
| | | | |
jamesward.com
|
|
| | | [AI summary] The author provides a Java and Akka code example demonstrating how to compose Futures to execute multiple tasks concurrently and wait for their completion. | ||
