Abstracting models of strong normalization for classical calculi
Abstract
Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Here, building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which are both specialized for one discipline, we develop a single uniform framework for strong normalization encompassing call-by-name, call-by-value, call-by-need, call-by-push-value, non-deterministic disciplines, and any others satisfying some simple criteria. Furthermore, we explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs.
- Authors:
- Publication Date:
- Research Org.:
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)
- OSTI Identifier:
- 2284030
- Alternate Identifier(s):
- OSTI ID: 1595425; OSTI ID: 1703064
- Report Number(s):
- SAND-2019-15278J
Journal ID: ISSN 2352-2208; S2352220819301579; 100512; PII: S2352220819301579
- Grant/Contract Number:
- NA0003525; AC04-94AL85000
- Resource Type:
- Published Article
- Journal Name:
- Journal of Logical and Algebraic Methods in Programming
- Additional Journal Information:
- Journal Name: Journal of Logical and Algebraic Methods in Programming Journal Volume: 111 Journal Issue: C; Journal ID: ISSN 2352-2208
- Publisher:
- Elsevier
- Country of Publication:
- Country unknown/Code not available
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; Strong normalization; Calling convention; Biorthogonality; Symmetric candidates; Sequent calculus
Citation Formats
Downen, Paul, Johnson-Freyd, Philip, and Ariola, Zena M. Abstracting models of strong normalization for classical calculi. Country unknown/Code not available: N. p., 2020.
Web. doi:10.1016/j.jlamp.2019.100512.
Downen, Paul, Johnson-Freyd, Philip, & Ariola, Zena M. Abstracting models of strong normalization for classical calculi. Country unknown/Code not available. https://doi.org/10.1016/j.jlamp.2019.100512
Downen, Paul, Johnson-Freyd, Philip, and Ariola, Zena M. Sat .
"Abstracting models of strong normalization for classical calculi". Country unknown/Code not available. https://doi.org/10.1016/j.jlamp.2019.100512.
@article{osti_2284030,
title = {Abstracting models of strong normalization for classical calculi},
author = {Downen, Paul and Johnson-Freyd, Philip and Ariola, Zena M.},
abstractNote = {Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Here, building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which are both specialized for one discipline, we develop a single uniform framework for strong normalization encompassing call-by-name, call-by-value, call-by-need, call-by-push-value, non-deterministic disciplines, and any others satisfying some simple criteria. Furthermore, we explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs.},
doi = {10.1016/j.jlamp.2019.100512},
journal = {Journal of Logical and Algebraic Methods in Programming},
number = C,
volume = 111,
place = {Country unknown/Code not available},
year = {Sat Feb 01 00:00:00 EST 2020},
month = {Sat Feb 01 00:00:00 EST 2020}
}
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1016/j.jlamp.2019.100512
https://doi.org/10.1016/j.jlamp.2019.100512
Other availability
Search WorldCat to find libraries that may hold this journal
Cited by: 3 works
Citation information provided by
Web of Science
Web of Science
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
The Duality of Classical Intersection and Union Types
journal, October 2019
- Downen, Paul; Ariola, Zena M.; Ghilezan, Silvia
- Fundamenta Informaticae, Vol. 170, Issue 1-3
A Syntactic Approach to Type Soundness
journal, November 1994
- Wright, A. K.; Felleisen, M.
- Information and Computation, Vol. 115, Issue 1
Call-by-name, call-by-value and the λ-calculus
journal, December 1975
- Plotkin, G. D.
- Theoretical Computer Science, Vol. 1, Issue 2
Intensional interpretations of functionals of finite type I
journal, August 1967
- Tait, W. W.
- Journal of Symbolic Logic, Vol. 32, Issue 2
Untersuchungen �ber das logische Schlie�en. I
journal, December 1935
- Gentzen, Gerhard
- Mathematische Zeitschrift, Vol. 39, Issue 1
Parametric polymorphism and operational equivalence
journal, June 2000
- Pitts, Andrew M.
- Mathematical Structures in Computer Science, Vol. 10, Issue 3
A call-by-name lambda-calculus machine
journal, October 2007
- Krivine, Jean-Louis
- Higher-Order and Symbolic Computation, Vol. 20, Issue 3
Classical F ω
journal, April 2008
- Lengrand, Stéphane; Miquel, Alexandre
- Annals of Pure and Applied Logic, Vol. 153, Issue 1-3