Böhm tree

Known as: Bohm tree, Bohm trees, Böhm trees 
A Böhm tree is a (potentially infinite) tree-like mathematical object that can be used to provide denotational semantics (the "meaning") for terms of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we introduce a strong form of eta reduction called etabang that we use to construct a confluent and normalising… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Higher-order recursive schemes (HORS) are schematic representations of functional programs. They generate possibly infinite… (More)
  • figure 1
Is this relevant?
2012
2012
We prove the correctness of an algorithm for normalizing untyped combinator terms by evaluation. The algorithm is written in the… (More)
Is this relevant?
2012
2012
Parigot’s λμ-calculus (Parigot, 1992 [1]) is now a standard reference about the computational content of classical logic as well… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2010
2010
We investigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to… (More)
Is this relevant?
2004
2004
In this paper we define Böhm-like trees for term rewriting systems (TRSs). The definition is based on the similarities between… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta… (More)
Is this relevant?
2001
2001
This paper develops a general technique to analyze the head r eduction of a term in a context. This technique is used to give a… (More)
Is this relevant?
1999
1999
We present a game model of the untyped λ-calculus, with equational theory equal to the Böhm tree λ-theory B, which is universal… (More)
Is this relevant?
1998
1998
Böhm trees are the natural infinite generalisations of normal forms in pure λ-calculus. They arose from the work of Böhm on… (More)
Is this relevant?