Towards Gradual Checking of Reference Capabilities

09/03/2019
by   Kiko Fernandez-Reyes, et al.
0

Concurrent and parallel programming is difficult due to the presence of memory side-effects, which may introduce data races. Type qualifiers, such as reference capabilities, can remove data races by restricting sharing of mutable data. Unfortunately, reference capability languages are an all-in or nothing game, i.e., all the types must be annotated with reference capabilities. In this work in progress, we propose to mix the ideas from the reference capability literature with gradual typing, leading to gradual reference capabilities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2021

Fuel: A Compiler Framework for Safe Memory Management

Flow-sensitive type systems offer an elegant way to ensure memory-safety...
research
05/31/2019

Reference Capabilities for Safe Parallel Array Programming

The array is a fundamental data structure that provides an efficient way...
research
06/02/2020

Uninitialized Capabilities

This technical report describes a new extension to capability machines. ...
research
11/21/2022

Methodology for Holistic Reference Modeling in Systems Engineering

Models in face of increasing complexity support development of new syste...
research
02/07/2019

Dual-Reference Design for Holographic Coherent Diffraction Imaging

A new reference design is introduced for Holographic Coherent Diffractio...
research
08/28/2020

Smoothly Navigating between Functional Reactive Programming and Actors

We formally define an elegant multi-paradigm unification of Functional R...
research
09/22/2019

Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection

The Minimal Learning Machine (MLM) is a nonlinear supervised approach ba...

Please sign up or login with your details

Forgot password? Click here to reset