The Bang Calculus Revisited

Bucciarelli, Antonio; Kesner, Delia; Ríos, Alejandro; Viso, Andrés

doi:10.1007/978-3-030-59025-3_2

Cited by 18 publications

(19 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we show how these translations work. We extend the simulation results in [15,30,7] for the pure case to the case with operators (Proposition 13).…”

Section: Cbn and Cbv Translations Into The Bang Calculusmentioning

confidence: 88%

“…Following [7], the CbV translation defined here differs from [15,30] in the application case. Section 5 will show why this optimization is crucial.…”

Section: Cbn and Cbv Translations Into The Bang Calculusmentioning

confidence: 99%

“…This approach has so far mainly be exploited semantically [21,10,11,15,9,7], but can be used it also to study operational properties [15,30,13]. In this paper, we push forward this operational direction.…”

Section: Introductionmentioning

confidence: 99%

“…Here we adopt the refined CbV embedding of Bucciarelli et al [7], which does preserve levels and normal forms. While the preservation of normal forms is already stressed in [7], the preservation of levels is proved here for the first time, and it is based on non-trivial properties of the embedding.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic

Faggian

Guerrieri

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In each variant of the $$\lambda $$ λ -calculus, factorization and normalization are two key properties that show how results are computed. Instead of proving factorization/normalization for the call-by-name (CbN) and call-by-value (CbV) variants separately, we prove them only once, for the bang calculus (an extension of the $$\lambda $$ λ -calculus inspired by linear logic and subsuming CbN and CbV), and then we transfer the result via translations, obtaining factorization/normalization for CbN and CbV.The approach is robust: it still holds when extending the calculi with operators and extra rules to model some additional computational features.

show abstract

“…Here we show how these translations work. We extend the simulation results in [15,30,7] for the pure case to the case with operators (Proposition 13).…”

Section: Cbn and Cbv Translations Into The Bang Calculusmentioning

confidence: 88%

“…Following [7], the CbV translation defined here differs from [15,30] in the application case. Section 5 will show why this optimization is crucial.…”

Section: Cbn and Cbv Translations Into The Bang Calculusmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic

Faggian

Guerrieri

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…They were first considered by themselves by Gardner [1994], and then by de Carvalho [2007,2018]; Kfoury [2000];Neergaard and Mairson [2004]Ða survey is [Bucciarelli et al 2017]. De Carvalho's use of multi types to give bounds to evaluation lengths has also been used in [Accattoli et al 2020c;Accattoli and Guerrieri 2018;Accattoli et al 2019b;Bernadet and Graham-Lengrand 2013;Bucciarelli et al 2020;de Carvalho et al 2011;Kesner and Vial 2020].…”

Section: Introductionmentioning

confidence: 99%

The (In)Efficiency of interaction

Accattoli

Lago

Vanoni

2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Evaluating higher-order functional programs through abstract machines inspired by the geometry of the interaction is known to induce space efficiencies, the price being time performances often poorer than those obtainable with traditional, environment-based, abstract machines. Although families of lambda-terms for which the former is exponentially less efficient than the latter do exist, it is currently unknown how general this phenomenon is, and how far the inefficiencies can go, in the worst case. We answer these questions formulating four different well-known abstract machines inside a common definitional framework, this way being able to give sharp results about the relative time efficiencies. We also prove that non-idempotent intersection type theories are able to precisely reflect the time performances of the interactive abstract machine, this way showing that its time-inefficiency ultimately descends from the presence of higher-order types.

show abstract