7 citations · 23 across the 9 of their papers we have counts for
9 papers
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…
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky
The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between Böhm trees. It is well known that the lambda-t…
Resource-Optimal Planning For An Autonomous Planetary Vehicle
Giuseppe Della Penna, Benedetto Intrigila, Daniele Magazzeni +1
Autonomous planetary vehicles, also known as rovers, are small autonomous vehicles equipped with a variety of sensors used to perform exploration and experiments on a planet's surf…
On some counting problems for semi-linear sets
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
Let be a subset of or . We can associate with a function which returns, for every , the number ${\c…