@Article{biernacki06,
author = {Dariusz Biernacki and Olivier Danvy and {Chung-chieh} Shan},
title = {On the Static and Dynamic Extents of Delimited Continuations},
journal = {Science of Computer Programming},
year = {2006},
volume = {60},
number = {3},
pages = {274--297},
url = {http://www.brics.dk/RS/05/36/}
}
@Article{Bird84,
author = {Richard S. Bird},
title = {Using circular programs to eliminate multiple traversals of data},
journal = {Acta Informatica},
year = {1984},
volume = {21},
number = {3},
month = {Oct},
pages = {239--250}
}
@Article{allison89,
author = {Lloyd Allison},
title = {Circular Programs and Self-Referential Structures},
journal = {Software Practice and Experience},
volume = {19},
number = {2},
month = {Feb},
year = {1989},
url = {http://www.csse.monash.edu.au/~lloyd/tildeFP/1989SPE/}
}
@inproceedings{wadler89,
author = {Philip Wadler},
title = {Theorems for free!},
booktitle = {FPCA '89: Proceedings of the fourth international conference on functional programming languages and computer architecture},
year = {1989},
isbn = {0-89791-328-0},
pages = {347--359},
location = {Imperial College, London, United Kingdom},
doi = {http://doi.acm.org/10.1145/99370.99404},
publisher = {ACM},
address = {New York, NY, USA},
url = {http://homepages.inf.ed.ac.uk/wadler/topics/parametricity.html}
}
@Article{friedman87,
author = "Daniel P Friedman and David S Wise",
title = "Cons should not evaluate it's arguments",
journal = "Automata, Languages, and Programming",
publisher = "Edinburgh University Press",
pages = "257--284",
year = 1976,
url = {http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR44},
}
@PhdThesis{santos95,
author = {Andr\'{e} L. M. Santos},
title = {Compilation by transfomation in non-strict functional languages},
school = {University of Glasgow},
month = {Jul},
year = {1995},
url = {http://www.di.ufpe.br/~alms/ps/thesis.ps.gz},
}
@Article{okasaki95,
author = {Chris Okasaki},
title = {Simple and Efficient Purely Functional Queues and Deques},
journal = {Journal of Functional Programming},
volume = {5},
number = {4},
pages = {583--592},
month = {Oct},
year = {1995},
url = {http://www.eecs.usma.edu/webs/people/okasaki/pubs.html#jfp95},
}
@Book{okasaki98,
author = {Chris Okasaki},
title = {Purely Functional Data Structures},
publisher = {Cambridge University Press},
year = {1998},
url = {http://www.eecs.usma.edu/webs/people/okasaki/pubs.html#cup98},
}
@misc{gill99,
author = {Andy Gill et al},
title = {The Monad Template Library},
url = {http://hackage.haskell.org/package/mtl},
}
@misc{smith-hackage09,
author = {Leon P Smith},
title = {control-monad-queue},
url = {http://hackage.haskell.org/package/control-monad-queue},
}
@Book{eopl,
author = {Daniel P Friedman and Mitchell Wand and Christopher T Haynes},
title = {Essentials of Programming Languages},
edition = {2},
publisher = {MIT Press},
year = {2001},
}
@phdthesis{erkok02,
author = {Levent Erk\"{o}k},
title = {Value Recursion in Monadic Computations},
school = {OGI School of Engineering, OHSU},
address = {Portland, Oregon},
year = {2002},
url = {http://leventerkok.googlepages.com/erkok-thesis.pdf},
}
@Book{haskellroad,
author = {Kees Doets and Jan van Eijck},
title = {The Haskell Road to Logic, Maths, and Programming},
publisher = {King's College Publications},
year = {2004},
}
@Article{bgj04,
author = {Clem {Baker-Finch} and Kevin Glynn and Simon {Peyton-Jones}},
title = {Constructed Product Result Analysis for Haskell},
journal = {Journal of Functional Programming},
volume = {14},
number = {2},
pages = {211-245},
month = {Mar},
year = {2004},
url = {http://research.microsoft.com/en-us/um/people/simonpj/Papers/cpr/},
}
@Article{swierstra05,
author = {Wouter Swietstra},
title = {Why Attribute Grammars Matter},
journal = {The Monad Reader},
volume = {4},
month = {Jul},
year = {2005},
url = {http://www.haskell.org/sitewiki/images/8/85/TMR-Issue13.pdf},
}
@Article{hinze06,
author = {Ralf Hinze and Ross Paterson},
title = {Finger trees: a simple general-purpose data structure},
journal = {Journal of Functional Programming},
volume = {16},
number = {2},
pages = {197--217},
year = {2006},
url = {http://www.soi.city.ac.uk/~ross/papers/FingerTree.pdf},
}
@inproceedings{okasaki00,
author = {Chris Okasaki},
title = {Breadth-first numbering: lessons from a small exercise in algorithm design},
booktitle = {ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming},
year = {2000},
isbn = {1-58113-202-6},
pages = {131--136},
doi = {http://doi.acm.org/10.1145/351240.351253},
publisher = {ACM},
address = {New York, NY, USA},
url = {http://www.eecs.usma.edu/webs/people/okasaki/pubs.html#icfp00},
}
@techreport{jones93,
author = {Geraint Jones and Jeremy Gibbons},
title = {Linear-time breadth-first tree algorithms: An exercise in the arithmetic of folds and zips},
institution = {Dept of Computer Science, University of Auckland},
year = {1993},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4052},
}