4 results
Thomas Ehrhard ; Antonio Bucciarelli ; Alberto Carraro ; Giulio Manzonetto.
We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus is related to Boudol's resource calculus and is derived from […]
Published on October 10, 2012
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\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal forms, equates two lambda-terms whenever their B\"ohm trees […]
Published on January 29, 2019
Flavien Breuvart ; Giulio Manzonetto ; Domenico Ruoppolo.
We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then […]
Published on July 20, 2018
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 $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of functional computation, based on the substitution mechanism, […]
Published on July 29, 2022