Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Giulio Manzonetto"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
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
Externí odkaz:
https://doaj.org/article/7affde186eb845a38a1feba657a30253
Autor:
Giulio Guerrieri, Giulio Manzonetto
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 292, Iss Proc. Linearity-TLLA 2018, Pp 15-30 (2019)
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-operator that allows both call-by-name and call-by-value lambda-calculi to
Externí odkaz:
https://doaj.org/article/a5cce7a783be4501b7a2e7df60a4d47d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 3 (2020)
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 def
Externí odkaz:
https://doaj.org/article/b40fe640e4834a548f474d8c49f6c390
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
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, eq
Externí odkaz:
https://doaj.org/article/420b00724d084f548817bec7f5d21f2f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 3 (2018)
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 mo
Externí odkaz:
https://doaj.org/article/f976c38b792140759c63840667b3a27b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 4 (2012)
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
Externí odkaz:
https://doaj.org/article/1518eeaba47047498134b0f457a61723
Autor:
Giulio, Manzonetto
In this paper we provide an abstract model theory for the untyped differential lambda-calculus and the resource calculus. In particular we propose a general definition of model of these calculi, namely the notion of linear reflexive object in a Carte
Externí odkaz:
http://arxiv.org/abs/1011.2307
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:218-248
Relational models of λ-calculus can be presented as type systems, the relational interpretation of a λ-term being given by the set of its typings. Within a distributors-induced bicategorical semantics generalizing the relational one, we identify th
Publikováno v:
Fundamenta Informaticae. 170:241-265
Autor:
Giulio Manzonetto, Davide Barbarossa
The speculative ambition of replacing the old theory of program approximation based on syntactic continuity with the theory of resource consumption based on Taylor expansion and originating from the differential λ-calculus is nowadays at hand. Using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cb8b82d5035a5c3ee8e8745b79fe4b0
https://hdl.handle.net/11585/916695
https://hdl.handle.net/11585/916695