A Calculus for Language Transformations

10/25/2019
by   Benjamin Mourad, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2021

EOLANG and phi-calculus

Object-oriented programming (OOP) is one of the most popular paradigms u...
research
12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...
research
01/31/2021

Commutative Monads for Probabilistic Programming Languages

A long-standing open problem in the semantics of programming languages s...
research
06/13/2023

The Undecidability of Typability in the Lambda-Pi-Calculus

The set of pure terms which are typable in the λΠ-calculus in a given co...
research
10/11/2017

Abductive functional programming, a semantic approach

We propose a call-by-value lambda calculus extended with a new construct...
research
07/15/2021

A Functional Programming Language with Versions

While modern software development heavily uses versioned packages, progr...
research
07/02/2019

Local Reasoning for Robust Observational Equivalence

We propose a new core calculus for programming languages with effects, i...

Please sign up or login with your details

Forgot password? Click here to reset