A deep inference system with a self-dual binder which is complete for linear lambda calculus

DOI10.1093/LOGCOM/EXU033zbMath1403.03021arXiv1212.4483OpenAlexW1487302275MaRDI QIDQ5739978

Luca Roversi

Publication date: 7 July 2016

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.4483

zbMATH Keywords

calculus of communicating systemsdeep inferencelinear lambda calculusstructural proof-theory

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Unnamed Item ⋮ Constructing weak simulations from linear implications for processes with private names

This page was built for publication: A deep inference system with a self-dual binder which is complete for linear lambda calculus