000183030 001__ 183030
000183030 005__ 20190316235542.0
000183030 037__ $$aCONF
000183030 245__ $$aDependent Object Types
000183030 269__ $$a2012
000183030 260__ $$c2012
000183030 336__ $$aConference Papers
000183030 520__ $$aWe propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models Scala’s path-dependent types, abstract type members and its mixture of nominal and structural typing through the use of refinement types. The core formalism makes no attempt to model inheritance and mixin composition. DOT normalizes Scala’s type system by unifying the constructs for type members and by providing classical intersection and union types which simplify greatest lower bound and least upper bound computations. In this paper, we present the DOT calculus, both formally and informally. We also discuss our work-in-progress to prove typesafety of the calculus.
000183030 6531_ $$acalculus
000183030 6531_ $$aobjects
000183030 6531_ $$adependent types
000183030 700__ $$0246589$$aAmin, Nada$$g164625
000183030 700__ $$0(EPFLAUTH)177178$$aMoors, Adriaan$$g177178
000183030 700__ $$0241835$$aOdersky, Martin$$g126003
000183030 7112_ $$a19th International Workshop on Foundations of Object-Oriented Languages$$cTucson, Arizona, USA$$dOctober 22, 2012
000183030 8564_ $$uhttps://github.com/namin/dot$$zURL
000183030 8564_ $$s311360$$uhttps://infoscience.epfl.ch/record/183030/files/fool.pdf$$yPublisher's version$$zPublisher's version
000183030 909C0 $$0252187$$pLAMP$$xU10409
000183030 909CO $$ooai:infoscience.tind.io:183030$$pconf$$pIC$$qGLOBAL_SET
000183030 917Z8 $$x164625
000183030 937__ $$aEPFL-CONF-183030
000183030 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000183030 980__ $$aCONF