Write a Blog >>
Fri 28 Sep 2018 14:17 - 14:40 at Frisco - Session 2: Scala Extensions & Parsing Chair(s): Philipp Haller

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
Session 2: Scala Extensions & ParsingScala 2018 at Frisco
Chair(s): Philipp HallerKTH, Sweden
13:10
22m
Talk
Garnishing Parsec with Parsley
Scala 2018
Jamie WillisUniversity of Bristol, UK, Nicolas WuUniversity of Bristol, UK
DOI
13:32
22m
Talk
Interflow: Interprocedural Flow-Sensitive Type Inference and Method Duplication
Scala 2018
Denys ShabalinEPFL, Switzerland, Martin OderskyEPFL, Switzerland
DOI
13:55
22m
Talk
Parser Combinators for Context-Free Path Querying
Scala 2018
Ekaterina VerbitskaiaSaint Petersburg State University, Russia, Ilya KirillovSaint Petersburg State University, Russia, Ilya NozkinSaint Petersburg State University, Russia, Semyon GrigorevSaint Petersburg State University, Russia
DOI
14:17
22m
Talk
Truly Abstract Interfaces for Algebraic Data Types: The Extractor Typing Problem
Scala 2018
Nicolas StuckiEPFL, Switzerland, Paolo G. GiarrussoEPFL, Switzerland, Martin OderskyEPFL, Switzerland
DOI