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.
There are three subcases, depending on whether the redex S is at the root, to the left of the application, or to the right of the application
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.