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

by   Noam Zeilberger, et al.

Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is the classical notion of an abelian group-valued "flow" on an abstract graph (Tutte, 1954). Typing a linear lambda term may be naturally seen as constructing a flow (on an embedded 3-valent graph with boundary) valued in a more general algebraic structure consisting of a preordered set equipped with an "implication" operation and unit satisfying composition, identity, and unit laws. Interesting questions and results from the theory of flows (such as the existence of nowhere-zero flows) may then be re-examined from the standpoint of lambda calculus and logic. For example, we give a characterization of when the local flow relations (across vertices) may be categorically lifted to a global flow relation (across the boundary), proving that this holds just in case the underlying map has the orientation of a lambda term. We also develop a basic theory of rewriting of flows that suggests topological meanings for classical completeness results in combinatory logic, and introduce a polarized notion of flow, which draws connections to the theory of proof-nets in linear logic and to bidirectional typing.


page 1

page 2

page 3

page 4


Proof Nets and the Linear Substitution Calculus

Since the very beginning of the theory of linear logic it is known how t...

Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations

In this paper I will develop a lambda-term calculus, lambda-2Int, for a ...

A conventional expansion of first-order Belnap-Dunn logic

This paper concerns an expansion of first-order Belnap-Dunn logic named ...

Lambek-Grishin Calculus: Focusing, Display and Full Polarization

Focused sequent calculi are a refinement of sequent calculi, where addit...

Exponentially Handsome Proof Nets and Their Normalization

Handsome proof nets were introduced by Retoré as a syntax for multiplica...

Abstract rewriting internalized

In traditional rewriting theory, one studies a set of terms up to a set ...

Make flows small again: revisiting the flow framework

We present a new flow framework for separation logic reasoning about pro...

Please sign up or login with your details

Forgot password? Click here to reset