Publications by Sandro Stucki | EPFL Graph Search

Stoic: Towards Disciplined Capabilities

Martin Odersky, Sandro Stucki, Nada Amin, Fengyun Liu, Paolo Giosuè Giarrusso

Capabilities are widely used in the design of software systems to ensure security. A system of capabilities can become a mess in the presence of objects and functions: objects may leak capabilities and functions may capture capabilities. They make reasonin ...

2020

Higher-Order Subtyping with Type Intervals

Sandro Stucki

Modern, statically typed programming languages provide various abstraction facilities at both the term- and type-level. Common abstraction mechanisms for types include parametric polymorphism -- a hallmark of functional languages -- and subtyping -- which ...

EPFL2017

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Sandro Stucki, Olivier Eric Paul Blanvillain, Heather Christine Klug, Fengyun Liu

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 ...

2017

The Essence of Dependent Object Types

Martin Odersky, Sandro Stucki, Nada Amin, Tiark Rompf, Karl Samuel Grütter

Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D-

Springer International Publishing2016

Fold-based fusion as a library: a generative programming pearl

Sandro Stucki, Manohar Jonnalagedda

Fusion is a program optimisation technique commonly implemented using special-purpose compiler support. In this paper, we present an alternative approach, implementing fold-based fusion as a standalone library. We use staging to compose operations on folds ...

ACM Press2015

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Sandro Stucki

The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application conditions (NACs) for arbitrary rule spans; this is a considerable generalisation compared with existing results for NACs, which onl ...

Springer2014

Staged parser combinators for efficient data processing

Martin Odersky, Sandro Stucki, Thierry Coppey, Manohar Jonnalagedda, Tiark Rompf

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Yin-yang: concealing the deep embedding of DSLs

Martin Odersky, Sandro Stucki, Vojin Jovanovic, Christoph Koch, Amir Shaikhha, Vladimir Nikolaev

Deeply embedded domain-specific languages (EDSLs) intrinsically compromise programmer experience for improved program performance. Shallow EDSLs complement them by trading program performance for good programmer experience. We present Yin-Yang, a framework ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Sandro Stucki, Thierry Coppey, Manohar Jonnalagedda, Tiark Rompf

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

Assoc Computing Machinery2014

What are the Odds? Probabilistic programming in Scala

Sandro Stucki, Nada Amin, Manohar Jonnalagedda, Tiark Rompf

Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...

ACM2013