A Path To DOT: Formalizing Fully Path-Dependent Types — mentioned by saityi

Wed, 05 Feb 2020 18:30:53 GMT

Scala is interesting in this sense; I'd consider it to be an ML-like language. It attempts to unify object systems and module systems, and they are fairly first class in Scala. Modules (objects) can be used as normal values; you can encode functors as functions or classes as needed; signatures (traits) are usable as values to some degree, too. >Furthermore, path-dependent types allow Scala to unify modules and objects, so that the same language constructs can be used to specify the overall structure of a program as well as its implementation details. The unification of the module and term…

Paper and discussion history. A mention is not an endorsement.

A Path To DOT: Formalizing Fully Path-Dependent Types — HN submission

Wed, 21 Aug 2019 19:11:16 GMT

A Path to DOT: Formalizing Fully Path-Dependent Types

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Path To DOT: Formalizing Fully Path-Dependent Types · HackerPapers discussions

A Path To DOT: Formalizing Fully Path-Dependent Types — mentioned by saityi

A Path To DOT: Formalizing Fully Path-Dependent Types — HN submission