Go to the corresponding LIPIcs Volume Portal 
Clairambault, Pierre ; Murawski, Andrzej S.
pdfformat: 

@InProceedings{clairambault_et_al:LIPIcs:2013:4364, author = {Pierre Clairambault and Andrzej S. Murawski}, title = {{B{\"o}hm Trees as HigherOrder Recursive Schemes}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {91102}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897644}, ISSN = {18688969}, year = {2013}, volume = {24}, editor = {Anil Seth and Nisheeth K. Vishnoi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4364}, URN = {urn:nbn:de:0030drops43644}, doi = {10.4230/LIPIcs.FSTTCS.2013.91}, annote = {Keywords: Lambda calculus, B{\"o}hm trees, Recursion Schemes} }
Keywords:  Lambda calculus, Böhm trees, Recursion Schemes  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)  
Issue Date:  2013  
Date of publication:  09.12.2013 