Computing with Böhm trees

MaRDI QIDQ2708318zbMATH OpenFDO

Authors R. David

Publication date 17 April 2001

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\)-termsBöhm treesdecorationhead reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• From Böhm's theorem to observational equivalences: an informal account
• Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
• scientific article; zbMATH DE number 1330448
• The infinitary lambda calculus of the infinite eta Böhm trees
• An algebraic view of the Böhm-out technique

Cited in

(12)

• An algebraic view of the Böhm-out technique
• Easiness in graph models
• Böhm trees as higher-order recursion schemes
• Abstract Böhm trees
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• scientific article; zbMATH DE number 1342275 (Why is no real title available?)
• Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
• From Böhm's theorem to observational equivalences: an informal account
• Discriminating lambda-terms using clocked Böhm trees
• Computing with Tangles
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications

This page was built for publication: Computing with Böhm trees

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