Semantic subtyping for non-strict languages

October 12, 2018 Β· Declared Dead Β· πŸ› Types for Proofs and Programs

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tommaso Petrucciani, Giuseppe Castagna, Davide Ancona, Elena Zucca arXiv ID 1810.05555 Category cs.PL: Programming Languages Citations 4 Venue Types for Proofs and Programs Last Checked 3 months ago
Abstract
Semantic subtyping is an approach to define subtyping relations for type systems featuring union and intersection type connectives. It has been studied only for strict languages, and it is unsound for non-strict semantics. In this work, we study how to adapt this approach to non-strict languages: in particular, we define a type system using semantic subtyping for a functional language with a call-by-need semantics. We do so by introducing an explicit representation for divergence in the types, so that the type system distinguishes expressions that are results from those which are computations that might diverge.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted