scientific article; zbMATH DE number 1499090

MaRDI QIDQ4501144zbMATH OpenFDO

Authors Silvia Ghilezan

Publication date 3 September 2000

zbMATH Keywords

genericity lemmaintersection type assignment systemsstrong normalization propertytyped lambda calculiuntyped lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 992007
• Reducibility Proofs in the λ-Calculus
• Typing untyped \(\lambda\)-terms, or reducibility strikes again!

Cited in

(15)

• Adding algebraic rewriting to the untyped lambda calculus
• Perpetual reductions in -calculus
• Typing untyped \(\lambda\)-terms, or reducibility strikes again!
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• scientific article; zbMATH DE number 2185664 (Why is no real title available?)
• scientific article; zbMATH DE number 2185726 (Why is no real title available?)
• scientific article; zbMATH DE number 992007 (Why is no real title available?)
• scientific article; zbMATH DE number 431764 (Why is no real title available?)
• scientific article; zbMATH DE number 6496907 (Why is no real title available?)
• scientific article; zbMATH DE number 2079019 (Why is no real title available?)
• Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
• A partial evaluator for the untyped lambda-calculus
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Proving the genericity lemma by leftmost reduction is simple
• Using typed lambda calculus to implement formal systems on a machine

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