A theory of linear typings as flows on 3-valent graphs

DOI10.1145/3209108.3209121zbMath1453.03012arXiv1804.10540OpenAlexW2964225259MaRDI QIDQ5145371

Noam Zeilberger

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph theorylinear logicnowhere-zero flowslambda calculus and combinatory logicskew-closed categories

Mathematics Subject Classification ID

Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40) Flows in graphs (05C21)

Related Items (3)

Eilenberg-Kelly reloaded ⋮ Bijections between planar maps and planar linear normal \(\lambda\)-terms with connectivity condition ⋮ Proof Theory of Partially Normal Skew Monoidal Categories

This page was built for publication: A theory of linear typings as flows on 3-valent graphs