Truly Abstract Interfaces for Algebraic Data Types: The Extractor Typing Problem
Pattern matching enables inspecting algebraic data types, but typically prevents hiding the implementation of the matched algebraic data type. In Scala, instead, extractors also allow pattern matching on non-algebraic data types and invoking methods on the obtained objects, while partially decoupling API consumers from the API implementation.
But as we show in this paper, pattern matching using extractors is restricted compared to matching against case classes. We argue this violates the appropriate variant of the uniform access principle. To address this problem, we propose a small language extension, which enables defining truly abstract interfaces and freely evolve their implementation.
Fri 28 Sep Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change
13:10 - 14:40
|Garnishing Parsec with Parsley|
|Interflow: Interprocedural Flow-Sensitive Type Inference and Method Duplication|
|Parser Combinators for Context-Free Path Querying|
Ekaterina VerbitskaiaSaint Petersburg State University, Russia, Ilya KirillovSaint Petersburg State University, Russia, Ilya NozkinSaint Petersburg State University, Russia, Semyon GrigorevSaint Petersburg State University, RussiaDOI
|Truly Abstract Interfaces for Algebraic Data Types: The Extractor Typing Problem|
Nicolas StuckiEPFL, Switzerland, Paolo G. GiarrussoEPFL, Switzerland, Martin OderskyEPFL, SwitzerlandDOI