Explore >> Select a destination
|
You are here 
|
text.marvinborner.de | ||
| | | | |
nithinbekal.com
|
|
| | | | | Nithin Bekal's blog about programming - Ruby, Rails, Vim, Elixir. | |
| | | | |
afnan.io
|
|
| | | | | A personal site | |
| | | | |
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: | |
| | | | |
www.jeremykun.com
|
|
| | | Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. | ||
