Difference between revisions of "Combinator Pearls"
Jump to navigation
Jump to search
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
This page lists programming examples for fun and ''functional pearls'', programs that albeit simple can show and teach interesting principles and techniques. | This page lists programming examples for fun and ''functional pearls'', programs that albeit simple can show and teach interesting principles and techniques. | ||
| + | |||
| + | *[[Uber die Bausteine der mathematischen Logik | On the Building Blocks of Mathematical Logic]] | ||
| + | |||
| + | *[[Combinator Birds]] | ||
| + | |||
| + | *[[Semantically]] | ||
*[[Fibs and Facts]] | *[[Fibs and Facts]] | ||
| Line 11: | Line 17: | ||
*[[Hanoi Towers]] | *[[Hanoi Towers]] | ||
| − | *[[ | + | *[[Sorting with Morphisms]] |
*[[Lam2Combi | Making a simple REPL for structured combinators ]] | *[[Lam2Combi | Making a simple REPL for structured combinators ]] | ||
Latest revision as of 02:33, 22 July 2022
This page lists programming examples for fun and functional pearls, programs that albeit simple can show and teach interesting principles and techniques.