Böhm trees as higher-order recursion schemes

DOI10.4230/LIPIcs.FSTTCS.2013.91zbMath1359.68043OpenAlexW1544413980MaRDI QIDQ2963900

Andrzej S. Murawski, Pierre Clairambault

Publication date: 21 February 2017

Full work available at URL: https://hal.science/hal-00966102

zbMATH Keywords

Böhm treeslambda-calculusrecursion schemes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)

Related Items (2)

A characterization of lambda-terms transforming numerals ⋮ Automata, Logic and Games for the $$\lambda $$ -Calculus

This page was built for publication: Böhm trees as higher-order recursion schemes