Concept
Simply typed lambda calculus
Publications associées (44)
Formal Autograding in a Classroom (Experience Report)
Viktor Kuncak, Mario Bucev, Dragana Milovancevic, Samuel Chassot
We report our experience in enhancing automated grading in a functional programming course using formal verification. In our approach, we deploy a verifier for Scala programs to check equivalences between student submissions and reference solutions. Conseq ...
2024Degrees of Separation: A Flexible Type System for Safe Concurrency
Martin Odersky, Yichen Xu, Aleksander Slawomir Boruch-Gruszecki
Data races have long been a notorious problem in concurrent programming. They are subtle to detect, and lead to non-deterministic behaviours. There has been a lot of interest in type systems that statically guarantee data race freedom. Significant progress ...
2024A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning
Yichen Xu, Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki
Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...
New York2022Proof of Multi-Stage Programming with Generative and Analytical Macros
Martin Odersky, Nicolas Alexander Stucki, Jonathan Immanuel Brachthäuser
In metaprogramming, code generation and code analysis are complementary. Traditionally, principled metaprogramming extensions for programming languages, like MetaML and BER MetaOCaml, offer strong foundations for code generation but lack equivalent support ...
EPFL2021Verified Functional Programming
In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language.
Our system is based on a dependently-typed language and an algorithmic type checking procedure
which ensures total correctness. We rely on SMT solve ...
EPFL2019Implementing Higher-Kinded Types in Dotty
Martin Odersky, Guillaume André Fradji Martres, Dmytro Petrashko
dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are jus ...
ACM2016Function Passing: A Model for Typed, Distributed Functional Programming
Philipp Haller, Jocelyn Boullier
The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model we call function passing designed to provide a more principled substrate on which to build data-centric distributed systems. A key id ...
Assoc Computing Machinery2016