Towards Algorithmic Typing for DOT

2017/08/17 by Abel Nieto, Nieto, Abel
Computer Science · #Computational Physics and Python Applications #FOS: Computer and information sciences #Logic, programming, and type systems #Parallel Computing and Optimization Techniques #Programming Languages (cs.PL)

paper · pdf · doi:10.48550/arxiv.1708.05437

openalex publication_date 2017/08/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Dependent Object Types (DOT) calculus formalizes key features of Scala. The D_

Related

• Mutable WadlerFest DOT
• A Path To DOT: Formalizing Fully Path-Dependent Types
• From F to DOT: Type Soundness Proofs with Definitional Interpreters
• A Simple Soundness Proof for Dependent Object Types
• A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning