Skip to main content

A nonstandard standardization theorem

Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi

DOI 10.1145/2535838.2535886 dblp BibTeX

Abstract

Standardization is a fundamental notion for connecting programming languages and rewriting calculi. Since both programming languages and calculi rely on substitution for defining their dynamics, explicit substitutions (ES) help further close the gap between theory and practice.

Related papers

Standard fixpoint iteration for Java bytecode verification TOPLAS 2000
Higher-Order Modules and the Phase Distinction POPL 1990
Translating dependency into parametricity ICFP 2004
Exercises in Nonstandard Static Analysis of Hybrid Systems CAV 2012
A Nonstandard Functional Programming Language APLAS 2017
Monadic and comonadic aspects of dependency analysis OOPSLA 2022
Hyperstream processing systems: nonstandard modeling of continuous-time signals POPL 2013
Abstract Interpretation with Infinitesimals - Towards Scalability in Nonstandard Static Analysis VMCAI 2016