Regular Böhm trees

DOI10.1017/S0960129598002643zbMath0923.03022OpenAlexW2135098752WikidataQ56608661 ScholiaQ56608661MaRDI QIDQ4236203

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) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items

A logical framework with higher-order rational (circular) terms, On structural properties of eta-expansions of identity