scientific article; zbMATH DE number 1523050

zbMATH Open0956.03011MaRDI QIDQ4511325FDOQ4511325

Authors: M. H. B. Sørensen 

Publication date: 30 October 2000

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

Recommendations

• Effective longest and infinite reduction paths in untyped λ-calculi
• Perpetual reductions in \(\lambda\)-calculus
• Infinite \(\lambda\)-calculus and types
• Reducibility Proofs in the λ-Calculus
• Reduction rules for intuitionistic \(\lambda\rho\)-calculus
• Infinitary lambda calculi from a linear perspective
• Fundamental theorems of extensional untyped \(\lambda\)-calculus revisited
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• An upper bound for reduction sequences in the typed \(\lambda\)-calculus
• Finitary corecursion for the infinitary lambda calculus

zbMATH Keywords

untyped \(\lambda\)-calculusinfinite reduction path

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (8)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• Towards a geometry of recursion
• Effective longest and infinite reduction paths in untyped λ-calculi
• An upper bound for reduction sequences in the typed \(\lambda\)-calculus
• Perpetual reductions in \(\lambda\)-calculus
• Title not available (Why is that?)
• On the longest perpetual reductions in orthogonal expression reduction systems
• Jumping and escaping: modular termination and the abstract path ordering

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