scientific article; zbMATH DE number 2079019

MaRDI QIDQ4474831zbMATH OpenFDO

Authors Jan Kuper

Publication date 21 July 2004

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Proving the genericity lemma by leftmost reduction is simple
• scientific article; zbMATH DE number 1499090
• No solvable lambda-value term left behind
• Simply-typed underdeterminism
• Infinite \(\lambda\)-calculus and types

Cited in

(4)

• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
• The use of the typed lambda calculus for guiding naive users in the representation and acquisition of part-whole knowledge
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Proving the genericity lemma by leftmost reduction is simple

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