Self-Assembly: Lightweight Language Extension and Datatype Generic Programming, All-in-One!

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

MiMiC is a flexible and efficient framework for multiscale simulations in which different subsystems are treated by individual client programs. In this work, we present a new interface with OpenMM to be used as an MM client program and we demonstrate its e ...

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

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

Systems code is challenging to verify, because it uses constructs (like raw pointers, pointer arithmetic, and bit twiddling) that are hard for tools to reason about. Existing approaches either sacrifice programmer friendliness, by demanding significant man ...

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

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

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

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

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

Over the past decade, the Scala community has shown great interest in using type-level programming to obtain additional type safety. Unfortunately, the lack of support from the Scala compiler has been a barrier to the adoption of that technique, notably du ...

Programming languages and systems have failed to address the security implications of the increasingly frequent use of public libraries to construct modern software. Most languages provide tools and online repositories to publish, import, and use libraries ...

Programming has changed; programming languages have not. Modern software embraced reusable software components, i.e., public libraries, and runs in the cloud, on machines that co-locate applications from various origins. This new programming paradigm leads ...

Programming with monads can be advantageous even in imperative languages with builtin support for side effects. However, in these languages composing monadic programs is different from composing side effecting imperative programs. This does not need to be ...

In this paper, the influence of tip clearance on the performance of small-scale turbopumps is studied numerically on extensive parameter ranges suitable for organic Rankine cycle applications. A novel and fully parameterized design model is developed and u ...

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

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, or middleware, upon which to build data-centric distribute ...

Tasks routinely executed by humans involve sequences of actions performed with high dexterity and coordination. Fully specifying these actions such that a robot could replicate the task is often difficult. Furthermore the uncertainties introduced by the us ...

Safe object initialization is important to avoid a category of runtime errors in programming languages. In this paper, we provide a case study of the initialization patterns on the Dotty compiler. In particular, we find that calling dynamic-dispatching met ...

Software engineering practices have been steadily moving towards higher-level programming languages and away from lower-level ones. High-level languages tend to greatly improve safety, productivity, and code maintainability because they handle various impl ...

While event-driven programming is a widespread model for asynchronous computing, its inherent control flow fragmentation makes event-driven programs notoriously difficult to understand and maintain. Coroutines are a general control flow construct that can ...

Self-Assembly: Lightweight Language Extension and Datatype Generic Programming, All-in-One!

Chattez avec Graph Search

OpenMM–MiMiC Interface for Efficient and Flexible Multiscale Simulations

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Degrees of Separation: A Flexible Type System for Safe Concurrency

Practical Verification of System-Software Components Written in Standard C

Formal Foundations of Capture Tracking

Type-Preserving Compilation of Class-Based Languages

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Scaling Language Features for Program Verification

Type-Level Programming with Match Types

Abstractions for Type-Level Programming

Enclosure: Language-Based Restriction of Untrusted Libraries

Trust as a Programming Primitive

Representing Monads with Capabilities

The effects of the tip clearance on the performance of small-scale turbopumps for ORC applications; analysis and modeling

Verified Functional Programming

A Programming Model and Foundation for Lineage-Based Distributed Computation

Automatic extraction of constraints in manipulation tasks for autonomy and interaction

Initialization patterns in Dotty

Type-Safe Metaprogramming and Compilation Techniques For Designing Efficient Systems in High-Level Languages

Theory and Practice of Coroutines with Snapshots