A Core Calculus for Scala Type Checking

Cremet, Vincent; Garillot, François; Lenglet, Sergueï; Odersky, Martin

doi:10.1007/11821069_1

Cited by 40 publications

(39 citation statements)

References 24 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous formalizations include the νObj calculus (Odersky et al, 2003), Featherweight Scala (Cremet et al, 2006) and Scalina (Moors et al, 2008). The νObj calculus features a rich type language, including distinct notions of singleton types, type selections, record types, class types and compound types.…”

Section: Related Workmentioning

confidence: 99%

“…Furthermore, subtyping in νObj lacks unique upper or lower bounds, and mixin composition is not commutative. Type checking in νObj was shown to be undecidable, prompting the development of Featherweight Scala (Cremet et al, 2006) as an attempt at a calculus with decidable type checking. Scalina (Moors et al, 2008) was proposed as a formal underpinning for introducing higher-kinded types in Scala.…”

Section: Related Workmentioning

confidence: 99%

“…Work on DOT started in 2007, following earlier work on higher-level formalizations of Scala features (Odersky et al, 2003;Cremet et al, 2006). Preliminary versions of a calculus with path-dependent types were published in FOOL 2012 (Amin et al, 2012) and OOPSLA 2014 (Amin et al, 2014).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Essence of Dependent Object Types

Amin

Grütter

Odersky

et al. 2016

A List of Successes That Can Change the World

Self Cite

View full text Add to dashboard Cite

Abstract. Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D<: of dependent functions, it adds records, intersections and recursion to arrive at DOT, a calculus for dependent object types. The paper shows an encoding of System F with subtyping in D<: and demonstrates the expressiveness of DOT by modeling a range of Scala constructs in it.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Essence of Dependent Object Types

Amin

Grütter

Odersky

et al. 2016

A List of Successes That Can Change the World

Self Cite

View full text Add to dashboard Cite

show abstract

“…If the call on line 8 is dispatched on an object of this type, it will dispatch to A.foo, as previously discussed. Hence, this approach would create a smaller call graph in which there is only one outgoing edge for the call on line 8.…”

Section: Traitsmentioning

confidence: 99%

“…We consider how key Scala features such as traits, abstract type members, and closures can be accommodated, and present a family of successively more precise algorithms. In a separate technical report [4], we formally define our most precise algorithm for FS alg , the "Featherweight Scala" subset of Scala that was previously defined by Cremet et al [8], and prove its correctness by demonstrating that for each execution of a method call in the operational semantics, a corresponding edge exists in the constructed call graph.…”

Section: Introductionmentioning

confidence: 99%

Constructing Call Graphs of Scala Programs

Ali

Rapoport

Lhoták

et al. 2014

ECOOP 2014 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. ConsAs Scala gains popularity, there is growing interest in programming tools for it. Such tools often require call graphs. However, call graph construction algorithms in the literature do not handle Scala features, such as traits and abstract type members. Applying existing call graph construction algorithms to the JVM bytecodes generated by the Scala compiler produces very imprecise results due to type information being lost during compilation. We adapt existing call graph construction algorithms, Name-Based Resolution (RA) and Rapid Type Analysis (RTA), for Scala, and present a formalization based on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.

show abstract

Using Path-Dependent Types to Build Type Safe JavaScript Foreign Function Interfaces

Richard-Foy

Barais

Jézéquel

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The popularity of statically typed programming languages compiling to JavaScript shows that there exists a fringe of the programmer population interested in leveraging the benefits of static typing to write Web applications. To be of any use, these languages need to statically expose the Web browser dynamically typed native API, which seems to be a contradiction in terms. Indeed, we observe that existing statically typed languages compiling to JavaScript expose the browser API in ways that either are not type safe, or when they are, typically over constrain the programmers. This article presents new ways to encode the challenging parts of the Web browser API in static type systems such that both type safety and expressive power are preserved. Our first encoding relies on type parameters and can be implemented in most mainstream languages but drags phantom types up to the usage sites. The second encoding does not suffer from this inconvenience but requires the support of dependent types in the language.

show abstract

A Core Calculus for Scala Type Checking

Abstract: Abstract. We present a minimal core calculus that captures interesting constructs of the Scala programming language: nested classes, abstract types, mixin composition, and path dependent types. We show that the problems of type assignment and subtyping in this calculus are decidable.

Cited by 40 publications

References 24 publications

The Essence of Dependent Object Types

The Essence of Dependent Object Types

Constructing Call Graphs of Scala Programs

Using Path-Dependent Types to Build Type Safe JavaScript Foreign Function Interfaces

Contact Info

Product

Resources

About