Böhm trees as higher-order recursion schemes
From MaRDI portal
Publication:2963900
DOI10.4230/LIPIcs.FSTTCS.2013.91zbMath1359.68043MaRDI QIDQ2963900
Andrzej S. Murawski, Pierre Clairambault
Publication date: 21 February 2017
Full work available at URL: https://hal.science/hal-00966102
68N18: Functional programming and lambda calculus
68Q60: Specification and verification (program logics, model checking, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
Automata, Logic and Games for the $$\lambda $$ -Calculus, A characterization of lambda-terms transforming numerals