5 citations · 17 across the 6 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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…
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 ,…
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…
Efficient Type Checking for Path Polymorphism
Juan Edi, Andrés Viso, Eduardo Bonelli
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically ty…
Type Soundness for Path Polymorphism
Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the for…