Article

On the Relative Usefulness of Fireballs

Authors:

Beniamino Accattoli,

Claudio Sacerdoti CoenAuthors Info & Claims

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Pages 141 - 155

https://doi.org/10.1109/LICS.2015.23

Published: 06 July 2015 Publication History

Get Access

References

[1]

B. Accattoli and U. Dal Lago, "Beta Reduction is Invariant, Indeed," in CSL-LICS 2014, 2014, p. 8.

Google Scholar

[2]

G. E. Blelloch and J. Greiner, "Parallelism in sequential functional languages," in FPCA, 1995, pp. 226-237.

Digital Library

Google Scholar

[3]

D. Sands, J. Gustavsson, and A. Moran, "Lambda calculi and linear speedups," in The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, 2002, pp. 60-84.

Digital Library

Google Scholar

[4]

U. Dal Lago and S. Martini, "The weak lambda calculus as a reasonable machine," Theor. Comput. Sci., vol. 398, no. 1-3, pp. 32-50, 2008.

Digital Library

Google Scholar

[5]

U. Dal Lago and S. Martini, "On constructor rewrite systems and the lambda calculus," Logical Methods in Computer Science, vol. 8, no. 3, 2012.

Google Scholar

[6]

B. Accattoli and U. Dal Lago, "On the invariance of the unitary cost model for head reduction," in RTA, 2012, pp. 22-37.

Google Scholar

[7]

B. Accattoli, E. Bonelli, D. Kesner, and C. Lombardi, "A nonstandard standardization theorem," in POPL, 2014, pp. 659-670.

Digital Library

Google Scholar

[8]

B. Grégoire and X. Leroy, "A compiled implementation of strong reduction," in (ICFP '02), 2002, pp. 235-246.

Digital Library

Google Scholar

[9]

L. Paolini and S. Ronchi Della Rocca, "Call-by-value solvability," ITA, vol. 33, no. 6, pp. 507-534, 1999.

Google Scholar

[10]

B. Accattoli and L. Paolini, "Call-by-value solvability, revisited," in FLOPS, 2012, pp. 4-16.

Digital Library

Google Scholar

[11]

A. Carraro and G. Guerrieri, "A semantical and operational account of call-by-value solvability," in FOSSACS 2014, 2014, pp. 103-118.

Google Scholar

[12]

J.-J. Lévy, "Réductions correctes et optimales dans le lambda-calcul," Thése d'Etat, Univ. Paris VII, France, 1978.

Google Scholar

[13]

R. Milner, M. Tofte, R. Harper, and D. Macqueen, The Definition of Standard ML - Revised. The MIT Press, May 1997.

Digital Library

Google Scholar

[14]

D. Clément, T. Despeyroux, G. Kahn, and J. Despeyroux, "A simple applicative language: Mini-ml," in LFP '86. New York, NY, USA: ACM, 1986, pp. 13-27.

Digital Library

Google Scholar

[15]

B. Accattoli, P. Barenbaum, and D. Mazza, "Distilling abstract machines," in ICFP 2014, 2014, pp. 363-376.

Digital Library

Google Scholar

[16]

B. Accattoli and C. Sacerdoti Coen, "On the value of variables," in WoLLIC 2014, 2014, pp. 36-50.

Google Scholar

[17]

B. Accattoli and C. Sacerdoti Coen, "On the Relative Usefullness of Fireballs," arXiv:1505.03791, pp. 1-34, 2015, pre-print with Technical Appendix. [Online]. Available: http://arxiv.org/abs/1505.03791

Digital Library

Google Scholar

[18]

R. Milner, "Local bigraphs and confluence: Two conjectures," Electr. Notes Theor. Comput. Sci., vol. 175, no. 3, pp. 65-73, 2007.

Digital Library

Google Scholar

[19]

D. Kesner and S. Ó. Conchúir, "Milner's lambda calculus with partial substitutions," Paris 7 University, Tech. Rep., 2008.

Google Scholar

[20]

B. Accattoli and D. Kesner, "The structural ¿-calculus," in CSL, 2010, pp. 381-395.

Digital Library

Google Scholar

[21]

N. G. de Bruijn, "Generalizing Automath by Means of a Lambda-Typed Lambda Calculus," in Mathematical Logic and Theoretical Computer Science, ser. Lecture Notes in Pure and Applied Mathematics, no. 106. Marcel Dekker, 1987, pp. 71-92.

Google Scholar

[22]

R. P. Nederpelt, "The fine-structure of lambda calculus," Eindhoven Univ. of Technology, Tech. Rep. CSN 92/07, 1992.

Google Scholar

[23]

B. Accattoli, "An abstract factorization theorem for explicit substitutions," in RTA, 2012, pp. 6-21.

Google Scholar

[24]

P. Curien, "An abstract framework for environment machines," Theor. Comput. Sci., vol. 82, no. 2, pp. 389-402, 1991.

Digital Library

Google Scholar

[25]

T. Hardin and L. Maranget, "Functional runtime systems within the lambda-sigma calculus," J. Funct. Program., vol. 8, no. 2, pp. 131-176, 1998.

Digital Library

Google Scholar

[26]

M. Biernacka and O. Danvy, "A concrete framework for environment machines," ACM Trans. Comput. Log., vol. 9, no. 1, 2007.

Digital Library

Google Scholar

[27]

F. Lang, "Explaining the lazy Krivine machine using explicit substitution and addresses," Higher-Order and Symbolic Computation, vol. 20, no. 3, pp. 257-270, 2007.

Digital Library

Google Scholar

[28]

P. Crégut, "Strongly reducing variants of the Krivine abstract machine," Higher-Order and Symbolic Computation, vol. 20, no. 3, pp. 209-230, 2007.

Digital Library

Google Scholar

[29]

Z. M. Ariola, A. Bohannon, and A. Sabry, "Sequent calculi and abstract machines," ACM Trans. Program. Lang. Syst., vol. 31, no. 4, 2009.

Digital Library

Google Scholar

[30]

M. Fernández and N. Siafakas, "New developments in environment machines," Electr. Notes Theor. Comput. Sci., vol. 237, pp. 57-73, 2009.

Digital Library

Google Scholar

[31]

O. Danvy and I. Zerny, "A synthetic operational account of call-by-need evaluation," in PPDP, 2013, pp. 97-108.

Digital Library

Google Scholar

[32]

V. Danos and L. Regnier, "Head linear reduction," Tech. Rep., 2004.

Google Scholar

[33]

O. Danvy and L. R. Nielsen, "Refocusing in reduction semantics," BRICS, Tech. Rep. RS-04-26, 2004.

Google Scholar

[34]

M. Wand, "On the correctness of the krivine machine," Higher-Order and Symbolic Computation, vol. 20, no. 3, pp. 231-235, 2007.

Digital Library

Google Scholar

[35]

D. P. Friedman, A. Ghuloum, J. G. Siek, and O. L. Winebarger, "Improving the lazy krivine machine," Higher-Order and Symbolic Computation, vol. 20, no. 3, pp. 271-293, 2007.

Digital Library

Google Scholar

[36]

P. Sestoft, "Deriving a lazy abstract machine," J. Funct. Program., vol. 7, no. 3, pp. 231-264, 1997.

Digital Library

Google Scholar

[37]

G. J. Jacobson, "Succinct static data structures," Ph.D. dissertation, Pittsburgh, PA, USA, 1988, aAI8918056.

Digital Library

Google Scholar

[38]

C. Grabmayer and J. Rochel, "Maximal sharing in the lambda calculus with letrec," in ICFP 2014, 2014, pp. 67-80.

Digital Library

Google Scholar

[39]

M. S. Paterson and M. N. Wegman, "Linear unification," in STOC '76. New York, NY, USA: ACM, 1976, pp. 181-186.

Digital Library

Google Scholar

[40]

D. de Champeaux, "About the Paterson-Wegman linear unification algorithm," J. Comput. Syst. Sci., vol. 32, no. 1, pp. 79-90, Feb. 1986.

Digital Library

Google Scholar

Cited By

View all

Accattoli BGuerrieri GLeberle M(2023)Strong Call-by-Value and Multi TypesTheoretical Aspects of Computing – ICTAC 202310.1007/978-3-031-47963-2_13(196-215)Online publication date: 4-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-47963-2_13
Biernacka MCharatonik WDrab T(2022)A simple and efficient implementation of strong call by need by an abstract machineProceedings of the ACM on Programming Languages10.1145/35498226:ICFP(109-136)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3549822
Accattoli BGuerrieri G(2022)The theory of call-by-value solvabilityProceedings of the ACM on Programming Languages10.1145/35476526:ICFP(855-885)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547652
Show More Cited By

Recommendations

Reexamining Relative Advantage and Perceived Usefulness: An Empirical Study

Relative advantage and perceived usefulness are often used interchangeably in the literature. In this paper, the authors argue that this limits the understanding of the adoption of ICTs, especially when there are multiple alternatives. To address this ...
The Mediating of Perceived Usefulness and Perceived Ease of Use: The Case of Mobile Banking in Yemen

While there are a wide range of business opportunities available via mobile technologies, mobile banking services have not been widely accepted by bank clients in Yemen. This article aims to test the mediation effect of TAM core constructs between the ...
What motivates people to continuously post selfies? The moderating role of perceived relative advantage

Although there are numerous social media studies, relatively little attention has been paid to the moderating role of perceived relative advantage in selfie-posting behaviors. Accordingly, the primary purpose of this study is not only to examine the key ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

July 2015

776 pages

ISBN:9781479988754

In-Cooperation

EACSL: European Association for Computer Science Logic

Publisher

IEEE Computer Society

United States

Publication History

Published: 06 July 2015

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
28
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Accattoli BGuerrieri GLeberle M(2023)Strong Call-by-Value and Multi TypesTheoretical Aspects of Computing – ICTAC 202310.1007/978-3-031-47963-2_13(196-215)Online publication date: 4-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-47963-2_13
Biernacka MCharatonik WDrab T(2022)A simple and efficient implementation of strong call by need by an abstract machineProceedings of the ACM on Programming Languages10.1145/35498226:ICFP(109-136)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3549822
Accattoli BGuerrieri G(2022)The theory of call-by-value solvabilityProceedings of the ACM on Programming Languages10.1145/35476526:ICFP(855-885)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547652
Biernacka MCharatonik WDrab T(2021)A Derived Reasonable Abstract Machine for Strong Call by ValueProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479401(1-14)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1145/3479394.3479401
Accattoli BCondoluci ACoen CGorla D(2021)Strong call-by-value is reasonable, implosivelyProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470630(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470630
Accattoli BDal Lago UVanoni GGabbrielli MAbel ACheney J(2020)The Machinery of InteractionProceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming10.1145/3414080.3414108(1-15)Online publication date: 8-Sep-2020
https://dl.acm.org/doi/10.1145/3414080.3414108
Accattoli BBarras BVanhoof WPientka B(2017)Environments and the complexity of abstract machinesProceedings of the 19th International Symposium on Principles and Practice of Declarative Programming10.1145/3131851.3131855(4-16)Online publication date: 9-Oct-2017
https://dl.acm.org/doi/10.1145/3131851.3131855
Accattoli B(2016)The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$-CalculusProceedings of the 23rd International Workshop on Logic, Language, Information, and Computation - Volume 980310.1007/978-3-662-52921-8_1(1-21)Online publication date: 16-Aug-2016
https://dl.acm.org/doi/10.1007/978-3-662-52921-8_1

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

References

Cited By

Recommendations

Reexamining Relative Advantage and Perceived Usefulness: An Empirical Study

The Mediating of Perceived Usefulness and Perceived Ease of Use: The Case of Mobile Banking in Yemen

What motivates people to continuously post selfies? The moderating role of perceived relative advantage

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations