Böhm trees as higher-order recursion schemes

DOI10.4230/LIPICS.FSTTCS.2013.91zbMATH Open1359.68043OpenAlexW1544413980MaRDI QIDQ2963900FDOQ2963900

Authors: Pierre Clairambault, Andrzej S. Murawski 

Publication date: 21 February 2017

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

Recommendations

• scientific article; zbMATH DE number 1497857
• Abstract Böhm trees
• Logical Approaches to Computational Barriers
• Computing with Böhm trees
• Rewriting Techniques and Applications
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• Comparing Böhm-Like Trees
• Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
• Regular Böhm trees
• From loops to trees by-passing Feynman's theorem

zbMATH Keywords

lambda-calculusrecursion schemesBöhm trees

Mathematics Subject Classification ID

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

Cited In (6)

• Pumping by typing
• Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses
• Abstract Böhm trees
• A characterization of lambda-terms transforming numerals
• Automata, Logic and Games for the $$\lambda $$ -Calculus
• Homogeneity without loss of generality

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963900)