Paths, computations and labels in the \(\lambda\)-calculus
From MaRDI portal
Publication:673626
DOI10.1016/0304-3975(94)00279-7zbMath0873.03012OpenAlexW2077519206MaRDI QIDQ673626
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00279-7
labeling\(\lambda\)-calculusoptimal graph reductionpaths in the initial term of derivationredex-families
Related Items (9)
On the dynamics of sharing graphs ⋮ Quantitative weak linearisation ⋮ Unnamed Item ⋮ Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Infinitary combinatory reduction systems ⋮ Weak linearization of the lambda calculus ⋮ Parallel beta reduction is not elementary recursive ⋮ A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine ⋮ Redexes are stable in the λ-calculus
Cites Work
This page was built for publication: Paths, computations and labels in the \(\lambda\)-calculus
