skip to main content
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: 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:
 [1];  [2];  [1]
  1. Univ. of Oregon, Eugene, OR (United States)
  2. Univ. of Oregon, Eugene, OR (United States); Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-CA), Livermore, CA (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1595425
Alternate Identifier(s):
OSTI ID: 1703064
Report Number(s):
SAND-2019-15278J
Journal ID: ISSN 2352-2208; 682100
Grant/Contract Number:  
AC04-94AL85000; NA0003525
Resource Type:
Accepted Manuscript
Journal Name:
Journal of Logical and Algebraic Methods in Programming
Additional Journal Information:
Journal Volume: 111; Journal Issue: C; Journal ID: ISSN 2352-2208
Country of Publication:
United States
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. United States: N. p., 2019. Web. https://doi.org/10.1016/j.jlamp.2019.100512.
Downen, Paul, Johnson-Freyd, Philip, & Ariola, Zena M. Abstracting models of strong normalization for classical calculi. United States. https://doi.org/10.1016/j.jlamp.2019.100512
Downen, Paul, Johnson-Freyd, Philip, and Ariola, Zena M. Fri . "Abstracting models of strong normalization for classical calculi". United States. https://doi.org/10.1016/j.jlamp.2019.100512. https://www.osti.gov/servlets/purl/1595425.
@article{osti_1595425,
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 = {United States},
year = {2019},
month = {12}
}