A Calculus for Language Transformations

2019/10/25 by Mourad, Benjamin, Cimini, Matteo
#FOS: Computer and information sciences #Programming Languages (cs.PL)

paper · doi:10.48550/arxiv.1910.11924

Abstract

In this paper we propose a calculus for expressing algorithms for programming languages transformations. We present the type system and operational semantics of the calculus, and we prove that it is type sound. We have implemented our calculus, and we demonstrate its applicability with common examples in programming languages. As our calculus manipulates inference systems, our work can, in principle, be applied to logical systems.

Related

• From Program Logics to Language Logics
• Functions as proofs as processes
• A generalised editor calculus (Short Paper)
• Signatures and models for syntax and operational semantics in the presence of variable binding
• Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version)