activity
20162021
most citedStrong Bisimulation for Control Operators

5 citations · 11 across the 4 of their papers we have counts for

collaborators

8 papers

cs.LO2021

Encoding Tight Typing in a Unified Framework

Delia Kesner, Andrés Viso

This paper explores how the intersection type theories of call-by-name (CBN) and call-by-value (CBV) can be unified in a more general framework provided by call-by-push-value (CBPV…

cs.LO2021

A Strong Bisimulation for a Classical Term Calculus

Eduardo Bonelli, Delia Kesner, Andrés Viso

When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of -calculus translated to proof-nets, these inessential de…

cs.LO2020★ 1 cited

Pure Pattern Calculus à la de Bruijn

Alexis Martín, Alejandro Ríos, Andrés Viso

It is well-known in the field of programming languages that dealing with variable names and binders may lead to conflicts such as undesired captures when implementing interpreters…

cs.LO2020

The Bang Calculus Revisited

Antonio Bucciarelli, Delia Kesner, Alejandro Ríos +1

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Callby-Name (CBN) and Call-by-Value (CBV) semantics. The essence of this paradigm is captured by the Bang Calculu…

cs.LO2019★ 5 cited

Strong Bisimulation for Control Operators

Eduardo Bonelli, Delia Kesner, Andrés Viso

The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. This is achieved by introducing a relation ,…

cs.LO2018★ 5 cited

Call-by-Need, Neededness and All That

Delia Kesner, Alejandro Ríos, Andrés Viso

We show that call-by-need is observationally equivalent to weak-head needed reduction. The proof of this result uses a semantical argument based on a (non-idempotent) intersection…