scientific article; zbMATH DE number 3423994

MaRDI QIDQ5686017zbMATH OpenFDO

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)

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

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)