MOOC
Functional Programming
Publications associées (953)
Degrees 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 ...
2024When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism
Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki
Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...
Assoc Computing Machinery2024Formal Foundations of Capture Tracking
Aleksander Slawomir Boruch-Gruszecki
Type systems are a device for verifying properties of programs without running them. Many programming languages used in the industry have always had a type system, while others were initially created without a type system and later adopted one, when the ad ...
EPFL2024Formal 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 ...
2024Scala 3 syntax rewriting
We present syntax rewriting rules that translate Scala 2 code into Scala 3. Two major syntactic changes are introduced: new control structure syntax and significant indentation. We describe the design and the implementation of these rules and evaluate thei ...
2024Automated Formal Verification of Software Network Functions
Formally verifying the correctness of software is necessary to merit the trust people put in software systems. Currently, formal verification requires human effort to prove that a piece of code matches its specification and code changes to improve verifiab ...
EPFL2024Generative AI-Enabled Conversational Interaction to Support Self-Directed Learning Experiences in Transversal Computational Thinking
Denis Gillet, Juan Carlos Farah, Adrian Christian Holzer, Abdessalam Ouaazki
As computational thinking (CT) becomes increasingly acknowledged as an important skill in education, self-directed learning (SDL) emerges as a key strategy for developing this capability. The advent of generative AI (GenAI) conversational agents has disrup ...
2024Capturing Types
Martin Odersky, Aleksander Slawomir Boruch-Gruszecki, Ondrej Lhoták
Type systems usually characterize the shape of values but not their free variables. However, many desirable safety properties could be guaranteed if one knew the free variables captured by values. We describe CC
New York2023Type-Preserving Compilation of Class-Based Languages
Guillaume André Fradji Martres
The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is ...
EPFL2023Dynamic Linkers Are the Narrow Waist of Operating Systems
Adrien Ghosn, Charly Nicolas Lucien Castes
While software applications, programming languages, and hardware have changed, operating systems have not. Widely-used commodity operating systems are still modeled after the ones designed in the seventies. The accumulated burden of backward compatibility ...
Association for Computing Machinery2023