3 results
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
Emma Kerinec ; Giulio Manzonetto ; Michele Pagani.
The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension allows to define a satisfying notion of B\"ohm(-like) tree and […]
Published on July 15, 2020
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