scientific article; zbMATH DE number 1523050
From MaRDI portal
Publication:4511325
Recommendations
- Effective longest and infinite reduction paths in untyped λ-calculi
- Perpetual reductions in -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 -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
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 -calculus
- scientific article; zbMATH DE number 4047682 (Why is no real title available?)
- 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)
