Simplicitly: Foundations and Applications of Implicit Function Types
Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala offers implicit parameters which are used pervasively, but which cannot be abstracted over.
This paper describes a generalization of implicit parameters to implicit function types, a powerful way to abstract over the context in which some piece of code is run. We provide a formalization based on bidirectional type-checking that closely follows the semantics implemented by the Scala compiler.
To demonstrate their range of abstraction capabilities, we present several applications that make use of implicit function types. We show how to encode the builder pattern, tagless interpreters, reader and free monads and we assess the performance of the monadic structures presented.
Thu 11 JanDisplayed time zone: Tijuana, Baja California change
15:50 - 16:40
Language DesignResearch Papers at Bunker Hill
Chair(s): Zachary Tatlock University of Washington, Seattle
|An Axiomatic Basis for Bidirectional Programming|
Hsiang-Shang ‘Josh’ Ko National Institute of Informatics, Japan, Zhenjiang Hu National Institute of InformaticsLink to publication DOI Pre-print Media Attached File Attached
|Simplicitly: Foundations and Applications of Implicit Function Types|
Martin Odersky EPFL, Switzerland, Olivier Blanvillain EPFL, Fengyun Liu EPFL, Switzerland, Aggelos Biboudis Ecole Polytechnique Federale de Lausanne, Heather Miller Ecole Polytechnique Federale de Lausanne, Sandro Stucki EPFL