A confluent non-idempotent intersection type system for lambda-calculus induces a factorization of derivation spaces into garbage-free prefixes and garbage using a variant of the Grothendieck construction.
Thent = (λx.p )q→ p{ x :=q} =s andt′ is of the form (λ ℓx.p ′)[q′ 1,...,q ′ n]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Factoring Derivation Spaces via Intersection Types (Extended Version)
A confluent non-idempotent intersection type system for lambda-calculus induces a factorization of derivation spaces into garbage-free prefixes and garbage using a variant of the Grothendieck construction.