Difference between revisions of "Combinator Pearls"

Revision as of 09:11, 21 July 2022

This page lists programming examples for fun and functional pearls, programs that albeit simple can show and teach interesting principles and techniques.

Fibs and Facts

Algebraic Data Structures

Fizzbuzzing

Scheduling with Wheels

Hanoi Towers

Sorting with Morphisms

Making a simple REPL for structured combinators

Revision as of 12:23, 3 May 2022 (view source) Hamster (talk \| contribs) ← Older edit		Revision as of 09:11, 21 July 2022 (view source) Hamster (talk \| contribs) Newer edit →
Line 12:		Line 12:

	*[[Sorting \| Sorting with Morphisms]]		*[[Sorting \| Sorting with Morphisms]]
		+
		+	*[[Lam2Combi \| Making a simple REPL for structured combinators ]]

Difference between revisions of "Combinator Pearls"

Revision as of 09:11, 21 July 2022

Navigation menu

Search