scientific article; zbMATH DE number 3933030

zbMATH Open0583.03007MaRDI QIDQ3707989FDOQ3707989

Authors: Michael Karr 

Publication date: 1985

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

Recommendations

• Parallel reductions in \(\lambda\)-calculus
• Logical relations and the typed λ-calculus
• Church-Rosser theorem for typed functional systems
• Reducibility Proofs in the λ-Calculus
• Strong normalization from weak normalization in typed \(\lambda\)-calculi

zbMATH Keywords

Boundednessfinite degreeChurch-Rossercommutativity among reduction relationsreductions of termsWell foundedness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (9)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• Delaying unification algorithms for lambda calculi
• Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
• Perpetual reductions in \(\lambda\)-calculus
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Weak normalization implies strong normalization in a class of non-dependent pure type systems
• Title not available (Why is that?)

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