scientific article; zbMATH DE number 3423994

zbMath0269.02005MaRDI QIDQ5686017

Bruce Lercher, Jonathan P. Seldin, J. Roger Hindley

Publication date: 1972

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

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03D99) Combinatory logic and lambda calculus (03B40)

Related Items (37)

Functions on universal algebras ⋮ One method of defining the semantics of programming language constructs in terms of lambda calculus. II ⋮ Higher-order unification via combinators ⋮ Reductions of Residuals are Finite ⋮ Standard and Normal Reductions ⋮ Normal forms in combinatory logic ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Expressibility of functionals in D. Scott's LCF language ⋮ A new type assignment for λ-terms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A notation for lambda terms. A generalization of environments ⋮ Computation on graph-like expressions ⋮ Invertible terms in the lambda calculus ⋮ Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL ⋮ Definierbare Funktionen imλ-Kalkül mit Typen ⋮ Characterizing complexity classes by general recursive definitions in higher types ⋮ Capturing strong reduction in director string calculus ⋮ A calculus for reasoning about software composition ⋮ A unification algorithm for typed \(\bar\lambda\)-calculus ⋮ A unification algorithm for typed \(\overline\lambda\)-calculus ⋮ Least fixed points revisited ⋮ Functionals computable in series and in parallel ⋮ A global representation of the recursive functions in the \(\lambda\)- calculus ⋮ Unnamed Item ⋮ A discrimination algorithm inside \(\lambda -\beta\)-calculus ⋮ On analysing relevance constructively ⋮ The typed lambda-calculus is not elementary recursive ⋮ A solution to Curry and Hindley's problem on combinatory strong reduction ⋮ Expressive power of typed and type-free programming languages ⋮ A construction of one-point bases in extended lambda calculi ⋮ On the semantics of polymorphism ⋮ The completeness theorem for typing lambda-terms ⋮ Reduction graphs in the lambda calculus ⋮ The absence and the presence of fixed point combinators ⋮ Definition of the semantics of programming language constructs in terms of ?-calculus. I ⋮ A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction

This page was built for publication: