Milner's Lambda-Calculus with Partial Substitutions
Logic in Computer Science
2023-12-21 v1 Programming Languages
Abstract
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection typing discipline. The results on terms transfer to Milner's bigraphical model of the calculus. We relate Milner's calculus to calculi with definitions, to calculi with explicit substitutions, and to MELL Proof-Nets.
Keywords
Cite
@article{arxiv.2312.13270,
title = {Milner's Lambda-Calculus with Partial Substitutions},
author = {Delia Kesner and Shane Ó Conchúir},
journal= {arXiv preprint arXiv:2312.13270},
year = {2023}
}