@inproceedings{clairambault_et_al:LIPIcs:2013:4364,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: Lambda calculus, B{\"o}hm trees, Recursion Schemes},
    Author = {Clairambault, Pierre and Murawski, Andrzej S.},
    BookTitle = {Proc. of FSTTCS'13},
    Editor = {Seth, Anil and Vishnoi, Nisheeth K.},
    File = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (0) (0) - a - a - b.pdf},
    ISBN = {978-3-939897-64-4},
    ISSN = {1868-8969},
    Keywords = {simply-typed lambda calculus and normalization by evaluation},
    Pages = {91--102},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {LIPIcs},
    Title = {B{\"o}hm Trees as Higher-Order Recursive Schemes},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4364},
    Volume = {24},
    Year = {2013},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2013/4364},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.91},
    date-added = {2013-12-24 11:44:15 +0000},
    date-modified = {2014-01-01 14:48:14 +0000},
    file-2 = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (1) (0) - a - a - b.pdf},
    file-3 = {murawski (0) - a - a - b.pdf},
    file-4 = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (0) (0) - a - a - b.graffle},
    urn = {urn:nbn:de:0030-drops-43644},
    doi = {10.4230/LIPIcs.FSTTCS.2013.91}
}

@inproceedings{clairambault_et_al:LIPIcs:2013:4364, Address = {Dagstuhl, Germany}, Annote = {Keywords: Lambda calculus, B{\"o}hm trees, Recursion Schemes}, Author = {Clairambault, Pierre and Murawski, Andrzej S.}, BookTitle = {Proc. of FSTTCS'13}, Editor = {Seth, Anil and Vishnoi, Nisheeth K.}, File = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (0) (0) - a - a - b.pdf}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, Keywords = {simply-typed lambda calculus and normalization by evaluation}, Pages = {91--102}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {LIPIcs}, Title = {B{\"o}hm Trees as Higher-Order Recursive Schemes}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4364}, Volume = {24}, Year = {2013}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2013/4364}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.91}, date-added = {2013-12-24 11:44:15 +0000}, date-modified = {2014-01-01 14:48:14 +0000}, file-2 = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (1) (0) - a - a - b.pdf}, file-3 = {murawski (0) - a - a - b.pdf}, file-4 = {Böhm Trees as Higher-Order Recursive Schemes - Clairambault, Murawski (0) (0) - a - a - b.graffle}, urn = {urn:nbn:de:0030-drops-43644}, doi = {10.4230/LIPIcs.FSTTCS.2013.91} }