Cases of the reduction step C ′⟨(b ′, e ′ /v.alt)⟩ →a C ⟨(b, e/v.alt)⟩: – Case β/v.alt: C ′⟨((λx .c)/v.alt, e/v.alt)⟩ → β/v.alt C ′⟨cα @ ([x α /shortleftarrow/v.alt] e/v.alt)⟩

Let b ′′ → n C ′⟨(b ′, e ′ /v · 2017

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.LO · 2019-07-13 · unverdicted · novelty 7.0

Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.

citing papers explorer

Showing 1 of 1 citing paper.

Crumbling Abstract Machines cs.LO · 2019-07-13 · unverdicted · none · ref 61
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.

Cases of the reduction step C ′⟨(b ′, e ′ /v.alt)⟩ →a C ⟨(b, e/v.alt)⟩: – Case β/v.alt: C ′⟨((λx .c)/v.alt, e/v.alt)⟩ → β/v.alt C ′⟨cα @ ([x α /shortleftarrow/v.alt] e/v.alt)⟩

fields

years

verdicts

representative citing papers

citing papers explorer