Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Guerrieri, Giulio"'
This paper studies the strength of embedding Call-by-Name ({\tt dCBN}) and Call-by-Value ({\tt dCBV}) into a unifying framework called the Bang Calculus ({\tt dBANG}). These embeddings enable establishing (static and dynamic) properties of {\tt dCBN}
Externí odkaz:
http://arxiv.org/abs/2404.12951
This paper studies the notion of meaningfulness for a unifying framework called dBang-calculus, which subsumes both call-by-name (dCbN) and call-by-value (dCbV). We first characterize meaningfulness in dBang by means of typability and inhabitation in
Externí odkaz:
http://arxiv.org/abs/2404.06361
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over fin
Externí odkaz:
http://arxiv.org/abs/2404.03311
A fundamental issue in the $\lambda$-calculus is to find appropriate notions for meaningfulness. It is well-known that in the call-by-name $\lambda$-calculus (CbN) the meaningful terms can be identified with the solvable ones, and that this notion is
Externí odkaz:
http://arxiv.org/abs/2401.12212
This paper provides foundations for strong (that is, possibly under abstraction) call-by-value evaluation for the lambda-calculus. Recently, Accattoli et al. proposed a form of call-by-value strong evaluation for the lambda-calculus, the external str
Externí odkaz:
http://arxiv.org/abs/2309.12261
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a global le
Externí odkaz:
http://arxiv.org/abs/2308.07789
The denotational semantics of the untyped lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent notion of m
Externí odkaz:
http://arxiv.org/abs/2207.08697
Autor:
Faggian, Claudia, Guerrieri, Giulio
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings, such as effec
Externí odkaz:
http://arxiv.org/abs/2204.08772
This paper provides a characterization of call-by-value solvability using call-by-value multi types. Our work is based on Accattoli and Paolini's characterization of call-by-value solvable terms as those terminating with respect to the solving strate
Externí odkaz:
http://arxiv.org/abs/2202.03079
Autor:
Acclavio, Matteo, Guerrieri, Giulio
Publikováno v:
EPTCS 353, 2021, pp. 26-49
Differential linear logic (DiLL) provides a fine analysis of resource consumption in cut-elimination. We investigate the subsystem of DiLL without promotion in a deep inference formalism, where cuts are at an atomic level. In our system every provabl
Externí odkaz:
http://arxiv.org/abs/2112.14963