Quantitative Global Memory

03/15/2023
by   Sandra Alves, et al.
0

We show that recent approaches of static analysis based on quantitative typing systems can be extended to programming languages with global state. More precisely, we define a call-by-value language equipped with operations to access a global memory, together with a semantic model based on a (tight) multi-type system that captures exact measures of time and space related to evaluation of programs. We show that the type system is quantitatively sound and complete with respect to the original operational semantics of the language.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

A Three-Valued Semantics for Typed Logic Programming

Types in logic programming have focused on conservative approximations o...
research
03/24/2022

Lang-n-Send: Processes That Send Languages

We present Lang-n-Send, a pi-calculus that is equipped with language def...
research
02/10/2020

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...
research
07/01/2019

The Semantics of Rank Polymorphism

Iverson's APL and its descendants (such as J, K and FISh) are examples o...
research
12/04/2019

A Quantitative Understanding of Pattern Matching

This paper shows that the recent approach to quantitative typing systems...
research
03/06/2023

Asynchronous Modal FRP

Over the past decade, a number of languages for functional reactive prog...
research
05/02/2021

The Power of Tightness for Call-By-Push-Value

We propose tight type systems for Call-by-Name (CBN) and Call-by-Value (...

Please sign up or login with your details

Forgot password? Click here to reset