Concept
Namespace
Related publications (7)
A 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 York2022Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation
This work aims to study the effects of wind uncertainties in civil engineering structural design. Optimising the design of a structure for safety or operability without factoring in these uncertainties can result in a design that is not robust to these per ...
EPFL2022Learning Representations of Source Code from Structure and Context
Large codebases are routinely indexed by standard Information Retrieval systems, starting from the assumption that code written by humans shows similar statistical properties to written text [Hindle et al., 2012]. While those IR systems are still relativel ...
2019Consensus and collision detectors in radio networks
We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...
2008Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stabilit ...
Association for Computing Machinery2006Distributed Subtyping
Rachid Guerraoui, João Barreto
One of the most frequent operations in object-oriented programs is the "instanceof" test, also called the "subtyping" test or the "type inclusion" test. This test determines if a given object is an instance of some type. Surprisingly, despite a lot of rese ...
2006Schema matching for structured document transformations
This dissertation studies structured document content reuse problem. In structured document content reuse, a document (or a part of document) structured under one schema must be restructured and translated into an instance of a different schema. Thus, a no ...
EPFL2004