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 ...

In this paper, we focus on strong normalization. In a reduction theory, a term is strongly normalizing if it is the start of no infinite reduction sequence.

Abstracting away the differences across languages enables us to study properties of those languages in a uniform way. In this paper, we focus on strong ...

Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their ...

Dec 20, 2019 · Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too.

Downen, Paul, Johnson-Freyd, Philip, and Ariola, Zena M. "Abstracting models of strong normalization for classical calculi". Journal of Logical and Algebraic ...

Mar 22, 2024 · Bibliographic details on Abstracting models of strong normalization for classical calculi.

Abstracting models of strong normalization for classical calculi. Journal of Logical and Algebraic Methods in Programming. Downen, Paul; Johnson-Freyd, Philip ...

We prove a strong normalization theorem for abstract term rewriting systems based on domain-theoretic models. The theorem applies to extensions of Gödel's ...

A µ-abstraction can also duplicate its context by using the abstracted co-variable more than once. Indeed, terms such as µα.c create a control effect much like.