The Bang Calculus and the Two Girard's Translations

04/15/2019
by   Giulio Guerrieri, et al.
0

We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-operator that allows both call-by-name and call-by-value lambda-calculi to be encoded in. We investigate how the bang calculus subsumes both call-by-name and call-by-value lambda-calculi from a syntactic and a semantic viewpoint.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2021

A Braided Lambda Calculus

We present an untyped linear lambda calculus with braids, the correspond...
research
05/09/2023

The Undecidability of Unification Modulo σ Alone

The rewriting system sigma is the set of rules propagating explicit subs...
research
01/20/2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)

In each variant of the lambda-calculus, factorization and normalization ...
research
08/01/2018

Explicit Auditing

The Calculus of Audited Units (CAU) is a typed lambda calculus resulting...
research
02/09/2023

Calculus of functional centrality

In this document, we present another perspective for the calculus of opt...
research
05/19/2021

Separating Sessions Smoothly

This paper introduces Hypersequent GV (HGV), a modular and extensible co...
research
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...

Please sign up or login with your details

Forgot password? Click here to reset