A Calculus for Language Transformations
Benjamin Mourad, Matteo Cimini
TL;DR
This paper introduces a formal calculus for expressing and analyzing algorithms that perform transformations on programming languages, supported by a type system, operational semantics, and practical implementation.
Contribution
It presents a novel calculus with a type system and semantics for language transformations, and demonstrates its applicability through implementation and examples.
Findings
The calculus is proven to be type sound.
Implementation confirms practical usability.
Applicable to logical systems as well.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.