Statman's Hierarchy Theorem

  title={Statman's Hierarchy Theorem},
  author={Bram Westerbaan and Bas Westerbaan and Rutger Kuyper and Carst Tankink and Remy Viehoff and HENK P. Barendregt},
In the Simply Typed $\lambda$-calculus Statman investigates the reducibility relation $\leq_{\beta\eta}$ between types: for $A,B \in \mathbb{T}^0$, types freely generated using $\rightarrow$ and a single ground type $0$, define $A \leq_{\beta\eta} B$ if there exists a $\lambda$-definable injection from the closed terms of type $A$ into those of type $B$. Unexpectedly, the induced partial order is the (linear) well-ordering (of order type) $\omega + 4$. In the proof a finer relation $\leq_{h… 
4 Citations

Behavioral Program Logic

A sequent calculus for object-oriented actors with futures that integrates a pointer analysis and bridges the gap between behavioral types and deductive verification is presented.

POR for Security Protocol Equivalences: Beyond Action-Determinism

This paper recast trace equivalence as a reachability problem, to which persistent and sleep set techniques can be applied, and shows how to effectively apply these results in the context of symbolic execution.

The Category of von Neumann Algebras

This dissertation includes an extensive introduction to the basic theory of $C^*$-algebras and von Neumann algebraes and its category of completely positive normal contractive maps.

Symbolic Verification of Distance Bounding Protocols

This work states that due to their abstract communication model, existing results and tools do not apply to distance bounding protocols, and therefore these protocols cannot be applied to contactless applications.



Statman's 1-Section Theorem

The statement of the theorem is reviewed, a detailed proof is given, and the significance of the result is discussed.

Lambda Calculus with Types

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype

Automata Theoretic Account of Proof Search

The automata-theoretic model for inhabitant search is proven to be adequate by reduction of the inhabitant existence problem to the emptiness problem for the automata by strengthening the claim that the latter has the same complexity as the former.

The lambda calculus - its syntax and semantics

  • H. Barendregt
  • Mathematics
    Studies in logic and the foundations of mathematics
  • 1985

Basic simple type theory

Let A ∈ H ω+2 be given. Then A is small and rk(A) ≤ 3, so A ∼ s

    Since A is small and rk(A) ≥ 4, there is a component