DeepAI
Log In Sign Up

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

01/20/2021
by   Claudia Faggian, et al.
0

In each variant of the lambda-calculus, factorization and normalization are two key-properties that show how results are computed. Instead of proving factorization/normalization for the call-by-name (CbN) and call-by-value (CbV) variants separately, we prove them only once, for the bang calculus (an extension of the lambda-calculus inspired by linear logic and subsuming CbN and CbV), and then we transfer the result via translations, obtaining factorization/normalization for CbN and CbV. The approach is robust: it still holds when extending the calculi with operators and extra rules to model some additional computational features.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/04/2020

Factorize Factorization

We present a new technique for proving factorization theorems for compou...
04/15/2019

The Bang Calculus and the Two Girard's Translations

We study the two Girard's translations of intuitionistic implication int...
04/20/2021

On reduction and normalization in the computational core

We study the reduction in a lambda-calculus derived from Moggi's computa...
08/29/2019

Factorization and Normalization, Essentially

Lambda-calculi come with no fixed evaluation strategy. Different strateg...
07/26/2022

Normalization for Fitch-Style Modal Calculi

Fitch-style modal lambda calculi enable programming with necessity modal...
01/04/2023

Solving The Ordinary Least Squares in Closed Form, Without Inversion or Normalization

By connecting the LU factorization and the Gram-Schmidt orthogonalizatio...
03/18/2019

A constructive proof of dependent choice in classical arithmetic via memoization

In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...