DeepAI AI Chat

Quantitative Global Memory

03/15/2023

∙

by Sandra Alves, et al.

∙

∙

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.

Sandra Alves
8 publications
Delia Kesner
13 publications
Miguel Ramos
3 publications

page 1

page 2

page 3

page 4

∙ 09/18/2019

A Three-Valued Semantics for Typed Logic Programming

Types in logic programming have focused on conservative approximations o...

0 João Barbosa, et al. ∙

∙ 03/24/2022

Lang-n-Send: Processes That Send Languages

We present Lang-n-Send, a pi-calculus that is equipped with language def...

0 Matteo Cimini, et al. ∙

∙ 02/10/2020

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...

0 Antonio Bucciarelli, et al. ∙

∙ 07/01/2019

The Semantics of Rank Polymorphism

Iverson's APL and its descendants (such as J, K and FISh) are examples o...

0 Justin Slepak, et al. ∙

∙ 12/04/2019

A Quantitative Understanding of Pattern Matching

This paper shows that the recent approach to quantitative typing systems...

0 Sandra Alves, et al. ∙

∙ 01/20/2020

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Quantitative aspects of computation are related to the use of both physi...

0 Alessandro Aldini, et al. ∙

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

0 Delia Kesner, et al. ∙