Functional pearls: A collection of advanced articles on functional programming selected from the Web, 1992-2015

fp Unraveling greedy algorithms 1992.pdf
fp Efficient sets 1993.pdf
fp On generating unique names 1994.pdf
fp The third homomorphism theorem 1995.pdf
fp Deriving representation changers functionally 1996.pdf
fp Deriving tidy drawings of trees research report 1996.pdf
fp Drawing trees 1996.pdf
fp Building trees with minimal height 1997.pdf
fp Lazy wheel sieves and spirals of primes 1997.pdf
fp The Zipper 1997.pdf
fp Three algorithms of Braun trees 1997.pdf
fp Diets for fat sets 1998.pdf
fp Monadic parsing in Haskell 1998.pdf
fp Sixth-order functions for parsing 1998.pdf
fp A pointless derivation of radix sort 1999.pdf
fp Explaining binomial heaps 1999.pdf
fp Polytypic unification 1999.pdf
fp Power series 1999.pdf
fp Proof-directed debugging 1999.pdf
fp Red-black trees in a functional setting 1999.pdf
fp Breadth-first numbering 2000.pdf
fp Combinators for breadth-first search 2000.pdf
fp Composing financial contracts 2000.pdf
fp Deriving backtracking monad transformers 2000.pdf
fp Perfect trees and bit-reversal permutations 2000.pdf
fp Poor man's concurrency monad 2000.pdf
fp Recursive subtyping revealed 2000.pdf
fp Do we need dependent types 2001.pdf
fp Functorial unparsing 2001.pdf
fp Logarithmic time addition circuit 2001.pdf
fp Maximum marking problems 2001.pdf
fp Normalization by evaluation 2001.pdf
fp Red-black trees with types 2001.pdf
fp Unfolding pointer algorithms 2001.pdf
fp Weaving a web 2001.pdf
fp Binary search trees revisited 2002.pdf
fp Countdown problem 2002.pdf
fp Monads for incremental computing 2002.pdf
fp Packrat parsing 2002.pdf
fp Formatting.. a class act 2003.pdf
fp Producing all ideals of a forest 2003.pdf
fp Trouble shared is trouble halved 2003.pdf
fp unpublished Alpha conversion is easy 2003.pdf
fp Composing fractals 2004.pdf
fp Concurrent distinct choices 2004.pdf
fp Derivation of a carry lookahead addition circuit 2004.pdf
fp Enumerating the strings of regular languages 2004.pdf
fp Functional chart parsing of CFG 2004.pdf
fp Functional satisfaction 2004.pdf
fp Global variables 2004.pdf
fp I am not a number 2004.pdf
fp Implicit configurations Kiselyov 2004.pdf
fp Inverting BWT 2004.pdf
fp Linear LC and PTIME-completeness 2004.pdf
fp Parallel parsing processes 2004.pdf
fp Parsing permutations phrases 2004.pdf
fp Pickler combinators 2004.pdf
fp Sieve of Eratosthenes 2004.pdf
fp Special issue on functional pearls.. Editorial 2004.pdf
fp Tiling a chessboard 2004.pdf
fp Type-safe cast 2004.pdf
fp Backtracking, terminating and interleaving monad transformers 2005.pdf
fp Scrap your nameplate 2005.pdf
fp Applicative programming with effects 2006.pdf
fp Enumerating the rationals 2006.pdf
fp Fifteen years of functional pearls 2006.pdf
fp How to write a functional pearl 2006.pdf
fp Marble mingling 2006.pdf
fp Probabilistic functional programming in Haskell 2006.pdf
fp Proof-directed debugging revisited 2006.pdf
fp Solve Sudoku in Haskell 2006.pdf
fp Strachey's first functional pearl 2006.pdf
fp Strong types for relational databases 2006.pdf
fp Type-safe, provably correct expression compiler in EPIGRAM 2006.pdf
fp First functional pearl - Barron-Strachey cartesian production function 2007.pdf
fp Great escape 2007.pdf
fp Bidirectionalization for free 2008.pdf
fp Data types a la carte 2008.pdf
fp Dissecting data structures 2008.pdf
fp Generic discrimination 2008.pdf
fp Parallel prefix computation 2008.pdf
fp Streams and unique fixed points 2008.pdf
fp The arrow calculus 2008.pdf
fp Undoing dynamic typing 2008.pdf
fp Free theorems involving type constructor classes 2009.pdf
fp Free theorems with type constructor classes 2009.pdf
fp Functional 1-2 brother trees 2009.pdf
fp Functional pearls - the Bird tree 2009.pdf
fp Linear bounded functional pretty-printing 2009.pdf
fp Tour d'Hanoi 2009.pdf
fp Every bit counts 2010.pdf
fp Play on regular expressions 2010.pdf
fp Scrap your zippers 2010.pdf
fp Parsing with derivatives 2011.pdf
fp Quote Antiquote Compile-time Parsing 2011.pdf
fp Swierstra DutchNationalFlag 2011.pdf
fp The Hough transform 2011.pdf
fp unpublished Quote antiquote 2011.pdf
fp When Maybe is not good enough 2011.pdf
fp Monoids 2012.pdf
fp Fun with semirings.. abuse of linear algebra 2013.pdf
fp Solving the Snake Cube 2013.pdf
fp Spivey. Maybe is not good enough 2013.pdf
fp Church encoding of data types considered harmful 2014.pdf
fp Deletion.. the curse of red-black tree 2014.pdf
fp Deriving a probability density calculator 2014.pdf
fp Folding domain-specific languages embedding 2014.pdf
fp Hindley-Milner elaboration in applicative style 2014.pdf
fp The Decorator pattern in Haskell 2014.pdf
fp A SQL to C compiler in 500 lines 2015.pdf
fp Smart view on datatypes 2015.pdf
fp The proof search monad 2015.pdf
fp Two can keep a secret 2015.pdf
fp All sorts of permutations 2016.pdf
fp Do you see what I see 2016.pdf
fp Loeb's theorem.. dependently typed quining 2016.pdf
fp Queueing and glueing for optimal partitioning 2016.pdf
fp String idiagrams for free monads 2016.pdf
Appel A. Efficient redblack trees 2011.pdf
Gibbons. More on merging and selection.pdf
Hinze. Prolog constructs in functional setting 2001.pdf
Seidel, Voigtlander. Automatically Generating Counterexamples To Naive Free Theorems.pdf
Seidel, Voigtlander. Improvements for free 1107.1203.pdf
Wadler P. Recursive types for free (1990).pdf
Wadler P. Theorems for free.pdf