Explore >> Select a destination
|
You are here 
|
programmingmadecomplicated.wordpress.com | ||
| | | | |
fbeedle.com
|
|
| | | | | This book provides a distinct way to teach discrete mathematics. Since discrete mathematics is crucial for rigorous study in computer science, many texts include applications of mathematical topics to computer science or have selected topics of particular interest to computer science. | |
| | | | |
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: | |
| | | | |
slightknack.dev
|
|
| | | | | A cozy little corner of the web. | |
| | | | |
bartoszmilewski.com
|
|
| | | This is part 12 of Categories for Programmers. Previously: Declarative Programming. See the Table of Contents. It seems like in category theory everything is related to everything and everything can be viewed from many angles. Take for instance the universal construction of the product. Now that we know more about functors and natural transformations, can... | ||
