scientific article; zbMATH DE number 3423994

zbMATH Open0269.02005MaRDI QIDQ5686017FDOQ5686017

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

Publication date: 1972

Title of this publication is not available (Why is that?)

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)

• 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
• Higher-order unification via combinators
• A notation for lambda terms. A generalization of environments
• Standard and Normal Reductions
• Expressibility of functionals in D. Scott's LCF language
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Definition of the semantics of programming language constructs in terms of ?-calculus. I
• Definierbare Funktionen imλ-Kalkül mit Typen
• A construction of one-point bases in extended lambda calculi
• The completeness theorem for typing lambda-terms
• Expressive power of typed and type-free programming languages
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Title not available (Why is that?)
• Invertible terms in the lambda calculus
• A discrimination algorithm inside \(\lambda -\beta\)-calculus
• Least fixed points revisited
• On Church's formal theory of functions and functionals. The \(\lambda\)- 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
• A calculus for reasoning about software composition
• The absence and the presence of fixed point combinators
• 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
• On the semantics of polymorphism

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)