Regular Böhm trees

DOI10.1017/S0960129598002643MaRDI QIDQ4236203zbMATH OpenOpenAlexWikidataFDO

Authors Gérard Huet

Publication date 22 March 1999

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129598002643

zbMATH Keywords

\(\lambda\)-calculusdecision procedureextensional equality of total Böhm treesregular systems of recursion equations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05)

Cited in

(6)

• On structural properties of eta-expansions of identity
• Böhm trees as higher-order recursion schemes
• Abstract Böhm trees
• A logical framework with higher-order rational (circular) terms
• A saturation-based unification algorithm for higher-order rational patterns
• Mechanising Böhm trees and -completeness

This page was built for publication: Regular Böhm trees

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