scientific article; zbMATH DE number 4039260

MaRDI QIDQ3777430zbMATH OpenFDO

Authors Akira Aiba

Publication date 1986

zbMATH Keywords

combinatory expressionslinear branched recursion schemarecursive programsreduction of lambda-terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Complexity of computation (including implicit computational complexity) (03D15) General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of the combinator reduction machine
• scientific article; zbMATH DE number 4045104
• scientific article; zbMATH DE number 3909737
• Optimality and inefficiency: what isn't a cost model of the lambda calculus?
• scientific article; zbMATH DE number 1231514

Cited in

(9)

• Complexity of the combinator reduction machine
• scientific article; zbMATH DE number 3909737 (Why is no real title available?)
• scientific article; zbMATH DE number 4045104 (Why is no real title available?)
• Efficiency comparisons in input–output systems
• scientific article; zbMATH DE number 4106256 (Why is no real title available?)
• scientific article; zbMATH DE number 1231514 (Why is no real title available?)
• Effective reduction and conversion strategies for combinators
• Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
• Classes of equational programs that compile into efficient machine code

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 Q3777430)