11 citations · 42 across the 14 of their papers we have counts for
12 papers · 1 filter
Groups and Inverse Semigroups in Lambda Calculus
Antonio Bucciarelli, Arturo De Faveri, Giulio Manzonetto +1
We study invertibility of -terms modulo -theories. Here a fundamental role is played by a class of -terms called finite hereditary permutations (FHP) and by their infinite…
Ohana trees, linear approximation and multi-types for the I-calculus: No variable gets left behind or forgotten!
Rémy Cerda, Giulio Manzonetto, Alexis Saurin
Although the I-calculus is a natural fragment of the -calculus, obtained by forbidding the erasure of arguments, its equational theories did not receive much attention. The r…
A Fully Abstract Model of PCF Based on Extended Addressing Machines
Benedetto Intrigila, Giulio Manzonetto, Nicolas Munnich
Extended addressing machines (EAMs) have been introduced to represent higher-order sequential computations. Previously, we have shown that they are capable of simulating -- via an…
Extended Addressing Machines for PCF, with Explicit Substitutions
Benedetto Intrigila, Giulio Manzonetto, Nicolas Munnich
Addressing machines have been introduced as a formalism to construct models of the pure, untyped lambda-calculus. We extend the syntax of their programs by adding instructions for…
Addressing Machines as models of lambda-calculus
Giuseppe Della Penna, Benedetto Intrigila, Giulio Manzonetto
Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the -calculus has played a central role…
The Bang Calculus and the Two Girard's Translations
Giulio Guerrieri, Giulio Manzonetto
We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-oper…