scientific article; zbMATH DE number 3423994

zbMATH Open0269.02005MaRDI QIDQ5686017FDOQ5686017

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

Publication date 1972

Mathematics Subject Classification ID

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

Cited in

(37)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5686017)