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. 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. We explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs.

现代编程语言会产生影响并混合多种调用约定，它们的核心运算量也应如此。我们通过调用惯例的“替代学科”（代表替代变量）来表征调用约定，并设计计算以在单个程序中混合学科。基于可简化性候选方法的变化形式，包括专门针对一门学科的双正交性和对称候选，我们为强规范化开发了一个统一的框架，包括按名称调用，按值调用，按需调用，按推值调用，非确定性学科以及其他满足某些简单条件的学科。我们阐述了先前方法的共性，并表明它们是统一框架的特殊情况，并且扩展到多学科计划。