A tree-shaped type system for eπ's composite subjects is proved sound, and exactly matches the 'expectable' type system of a class-based while-language under encoding.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Typing Composite Subjects
A tree-shaped type system for eπ's composite subjects is proved sound, and exactly matches the 'expectable' type system of a class-based while-language under encoding.