Publication
Stoic: Towards Disciplined Capabilities
Related publications (92)
Formal 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 ...
EPFL2024Dynamic 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 Machinery2023Language Model Decoding as Likelihood–Utility Alignment
Boi Faltings, Robert West, Maxime Jean Julien Peyrard, Martin Josifoski, Valentin Hartmann, Debjit Paul, Jiheng Wei, Frano Rajic
A critical component of a successful language generation pipeline is the decoding algorithm. However, the general principles that should guide the choice of a decoding algorithm re- main unclear. Previous works only compare decoding algorithms in narrow sc ...
2023Climatic Affinities or Type As A Structure Of Relations, Based On Typological Transfer In The Work Of Lacaton & Vassal And Other Similar Precedents
It is a generally accepted idea that typology is an essential element in the disciplinary dimension of architecture. The concept of typology, in its most common definition, is sufficiently malleable to cover a wide range of uses, but it is also this vaguen ...
2023Climatic Affinities or Type As A Structure Of Relations Based On Typological Transfer In The Work Of Lacaton & Vassal And Other Similar Precedents
It is a generally accepted idea that typology is an essential element in the disciplinary dimension of architecture. The concept of typology, in its most common definition, is sufficiently malleable to cover a wide range of uses, but it is also this vaguen ...
2023On algebraic array theories
Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. T ...
New York2023Type-Level Programming with Match Types
Martin Odersky, Olivier Eric Paul Blanvillain
Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...
ASSOC COMPUTING MACHINERY2022Scaling Language Features for Program Verification
Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...
EPFL2022A 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 ...
EPFL2021