scientific article

zbMath0558.03006MaRDI QIDQ3221960

Hendrik Pieter Barendregt

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semanticscartesian closed categoryfirst order axiomatizationlambda modelsreflexive objectequational axiomatizationlambda algebras

Mathematics Subject Classification ID

Properties of classes of models (03C52) Models of other mathematical theories (03C65) Combinatory logic and lambda calculus (03B40)

Related Items (26)

The differential \(\lambda \mu\)-calculus ⋮ Unnamed Item ⋮ Type theories, normal forms, and \(D_{\infty}\)-lambda-models ⋮ Non-speculative and upward invocation of continuations in a parallel language ⋮ A formalized general theory of syntax with bindings ⋮ Fixed points in lambda calculus. an eccentric survey of problems and solutions ⋮ Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation ⋮ Unnamed Item ⋮ Realizability models and implicit complexity ⋮ Probabilistic coherence spaces as a model of higher-order probabilistic computation ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cut Elimination, Substitution and Normalisation ⋮ On combinatory algebras and their expansions ⋮ Unnamed Item ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Dynamic game semantics ⋮ A game-semantic model of computation ⋮ The Simple Type Theory of Normalisation by Evaluation ⋮ Statistical properties of lambda terms ⋮ Compositional characterisations of \(\lambda\)-terms using intersection types ⋮ Unnamed Item ⋮ Categories with Families: Unityped, Simply Typed, and Dependently Typed ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS

This page was built for publication: