Böhm trees
Description: Böhm trees are possibly infinite tree representations of lambda-calculus terms, used to describe their computational and semantic structure.
Primary topic: Logic, programming, and type systems (95%)
Related topic: Logic, programming, and type systems (95%)
Wikidata ID: wiki/Q5005152
OpenAlex ID: keywords/bohm-trees
