A formal account of nets

Revision as of 09:50, 6 September 2012

The aim of this page is to provide a common framework for describing linear logic proof nets, interaction nets, multiport interaction nets, and the likes, while factoring out most of the tedious, uninteresting details (clearly not the fanciest page of LLWiki).

Preliminaries

The short story

the general flavor is that of multiport interaction nets;
the top/down or passive/active orientation of cells is related with the distinction between premisses and conclusions of rules, (and in that sense, a cut is not a logical rule, but the focus of interaction between two rules);
cuts are thus wires rather than cells/links: this fits with the intuition of GoI, but not with the most common presentations of proof nets;
when representing proof nets, we introduce axioms explicitly as cells, so that axiom-cuts do not vanish.

Nets

Wires

A wiring is the data of a finite set $P$ of ports and of a partition $W$ of $P$ by pairs (the wires): if $\{p,q\}\in{W}$ , we write $W (p) = q$ and $W (q) = p$ . Hence a wiring is equivalently given by an involutive permutation $W$ of finite domain $P$ , without fixpoints (forall $p$ , ${W}(p)\not=p$ ): the wires are then the orbits. Another equivalent presentation is to consider $W$ as a (simple, loopless, undirected) graph, with vertices in P, all of degree 1.

We say two wirings are disjoint when their sets of ports are. A connection between two disjoint wirings $W$ and $W'$ is a partial injection $(I,I',f):P\pinj P'$ : $I\subseteq P$ , $I'\subseteq P'$ and $f$ is a bijection $I\cong I'$ . We then write $W\bowtie_f{{W}'}$ for the wiring obtained by identifying the ports pairwise mapped by $f$ , and then ``straightening`` the paths thus obtained to recover wires: notice this might also introduce loops and we write $\Inner{W}{W'}_f$ for the number of loops thus appeared.

We describe these operations a bit more formally. Write $P = P_0\uplus I$ and $P' = P_0'\uplus I'$ . Then consider the graph $W\dblcolon_f{{W}'}$ with vertices in $P\cup P'$ , and such that there is an edge between $p$ and $q$ iff $q = W (p)$ or $q = W'(p)$ or $q = f (p)$ or $p = f (q)$ : in other words, $W\dblcolon_f{{W}'}=W\cup W'\cup f\cup f^{-1}$ . Vertices in $P_0\cup P'_0$ are of degree 1, and the others are of degree 2. Hence maximal paths in $W\dblcolon_f{{W}'}$ are of two kinds:

straight paths, with both ends in $P_0\cup P_0'$ ;
cycles, with vertices all in $I\cup I'$ .

Then the wires in $W\bowtie_f{{W}'}$ are the pairs ${p, p'}$ such that $p$ and $p'$ are the ends of a path in $W\dblcolon_f{{W}'}$ . And $\Inner{W}{W'}_{f}$ is the number of cycles in $W\dblcolon_f{{W}'}$ , or more precisely the number of support sets of cycles (i.e. we forget about the starting vertice of cycles).

Lemma

Consider three wirings $(P, W)$ , $(P', W')$ and $(P'', W'')$ , and two connections $(I,I',f):P\pinj P'$ and $(J',J'',g):P'\pinj P''$ such that $I'\cap J'=\emptyset$ . Then

$(W\bowtie_f W')\bowtie_g W''= W\bowtie_f(W'\bowtie_g W'')$

and

$\Inner{W}{W'}_{f}+\Inner{(W\bowtie_f{{W}'})}{{W}''}_g= \Inner{W}{(W'\bowtie_g W'')}_f+\Inner{{W}'}{{W}''}_g.$

Proof. The first equation holds because open maximal paths in $W\dblcolon_f{W'\bowtie_g}{{W}''}$ correspond with those in $W\dblcolon_f{(W'\dblcolon_g{{W}''})}$ , hence in $(W\dblcolon_f W')\dblcolon_g W''$ , hence in ${W\bowtie_f{{W}'}}\dblcolon_g{{W}''}$ . The second equation holds because both sides are two possible writings for the number of loops in ${(W\dblcolon_f{{W}'})}\dblcolon_g{{W}''}$

Nets

A signature is the data of a set $Σ$ of symbols, together with arity functions $\alpha:\Sigma\to\mathbf{N}\setminus\{0\}$ (number of active ports, or conclusions) and $\pi:\Sigma\to\mathbf N$ (number of passive ports, or hypotheses). In the remaining, we assume such a signature is given.

A cell $c$ with ports in $P$ is the data of a symbol $\sigma\in\Sigma$ and of two disjoint lists of pairwise distinct ports: $\alpha(c)\in P^{\alpha(\sigma)}$ is the list of active ports and $\pi(c)\in P^{\pi(\sigma)}$ is the list of passive ports.

A net is the data of a wiring $(P, W)$ , of a set $C$ of disjoint cells on $P$ , and of a number $L\in\mathbf N$ (the number of loops). It follows from the definitions that each port $p\in P$ appears in exactly one wire and in at most one cell: we say $p$ is free if it is not part of a cell, and $p$ is internal otherwise. Moreover, we say $p$ is dangling if $p$ is free and $W (p)$ is internal. We write $fp(R)$ for the set of free ports of a net $R$ .

Generally, the “names” of internal ports of a net are not relevant, but free ports matter most often: internal ports are the analogue of bound variables in $λ$ -terms. More formally, an isomorphism from net $R$ to net $R'$ is the data of a bijection of ports $\phi:P\cong P'$ and a bijection of cells $\psi:C\cong C'$ such that:

for all $p\in P$ , $W'(φ(p)) = φ(W (p))$ ;
for all $c\in C$ :
$L = L'$ .

Observe that under these conditions $ψ$ is uniquely induced by $φ$ . We say that the isomorphism $φ$ is nominal if moreover $p\in\textrm{fp}(R)$ implies $p = φ(p)$ .

Subnets

We say two nets are disjoint when their sets of ports are. Let $R$ and $R'$ be disjoint nets, and $(I, I', f)$ be a connection between $W$ and $W'$ , such that $I\subseteq \textrm{fp}(R)$ and $I'\subseteq \textrm{fp}(R')$ . We then write $R\bowtie_f{R'}$ for the net with wiring $W\bowtie_f{W'}$ , cells $C\cup C'$ and loops $\Inner{R}{R'}_f=L+L'+\Inner{W}{W'}_f$ . We say this connection is orthogonal if $\Inner{W}{W'}_f=0$ , and it is modular if the ports in $I\cup I'$ are all dangling: a modular connection is always orthogonal.

We say $R 0$ is a subnet of $R$ , if there exists a net $R'$ and a connection $(I, I', f)$ between $R 0$ and $R'$ such that $R=R_0\bowtie_f{R'}$ .

Lemma

Let $R 0$ , $R 1$ and $R'$ be nets such that $R 0$ and $R 1$ are disjoint from $R$ , $(I, I', f)$ be a connection $\textrm{fp}(R_0)\pinj \textrm{fp}(R')$ and $φ$ an isomorphism $R_0\cong R_1$ such that $φ(p) = φ(p')$ for all $p\in\textrm{fp}(R_0)\setminus I$ . Then $R_0\bowtie_f{R'}$ is nominally isomorphic to $R_1\bowtie_{f\circ\phi^{-1}}{R'}$ .

Rewriting

A net rewriting rule is a pair $(r 0, r 1)$ of nets such that $fp(r 0) = fp(r 1)$ . Then an instance of this rule is a pair $(R 0, R 1)$ such that there exist:

nets $R' 0$ and $R' 1$ isomorphic to $r 0$ and $r 1$ respectively, namely $R' i = φ i (r i)$ , so that moreover $φ 0 (p) = φ 1 (p)$ for all $p\in\textrm{fp}(r_0)$ (in particular, $fp(R' 0) = fp(R' 1)$ );
a net $R''$ , disjoint from $R' 0$ and $R' 1$ ;
a connection $(\textrm{fp}(R'_0),J,f):\textrm{fp}(R'_0)\pinj \textrm{fp}(R'')$ ;

such that each $R i$ is nominally isomorphic to $R'_i\bowtie_f{R''}$ .

Typing

A typing system on signature $Σ$ is the data of a set $Θ$ of types, an involutive negation $\cdot\orth:\Theta\to\Theta$ , together with a typing discipline for each symbol, i.e. a relation $\Theta(\sigma)\subseteq\Theta^{\alpha(\sigma)}\times\Theta^{\pi(\sigma)}$ . We then write $A_1,\cdots,A_{\pi(\sigma)}\vdash_\sigma B_1,\cdots,B_{\alpha(\sigma)}$ for $(\vec A,\vec B)\in\Theta(\sigma)$ .

Then a typing for net $R = (P, W, C)$ is a function $\tau:P\to \Theta$ such that:

for all $p\in P$ , $\tau(W(p))=\tau(p)\orth$ ;
for all $c\in C$ of symbol $σ$ , $\tau(\pi(c))\vdash\tau(\alpha(c))\orth$ ;

where, in the last formula, we implicitly generalized $τ$ to lists of ports and $\cdot\orth$ to lists of formulas, in the obvious, componentwise fashion. The interface of the typed net $(R,τ)$ is then the restriction of $τ$ to $fp(R)$ .

The idea, is that a wire ${p, q}$ bears the type $τ(q)$ (resp. $τ(p)$ ) in the direction $(p, q)$ (resp. $(q, p)$ ), so that a rule $\vec A\vdash_\sigma \vec B$ reads as an inference from passive inputs (hypotheses) to active outputs (conclusions).

Observe that if $(R,τ)$ is a typed net, and $\phi:R\cong R'$ is an isomorphism, then $R'$ is typed and its interface is $\tau\circ\phi^{-1}$ : in particular, if $φ$ is nominal, $R'$ and $R$ have the same interface.

Now let $(R,τ)$ and $(R',τ')$ be typed nets and $(I, I', f)$ a connection so that $\tau'\circ f$ and $\tau\orth=\cdot\orth\circ\tau$ coincide on $I$ . Then this induces a typing of $R\bowtie_f{R'}$ preserving the interface on the remaining free ports.

Boxes

TODO

@@ Line 104: / Line 104: @@
 is the list of ''passive'' ports.
-A ''net'' is the data of a wiring <math>(P,W)</math> and of a set <math>C</math> of disjoint cells on
+A ''net'' is the data of a wiring <math>(P,W)</math>, of a set <math>C</math> of disjoint cells on
-<math>P</math>. It follows from the definitions that each port <math>p\in P</math> appears in
+<math>P</math>, and of a number <math>L\in\mathbf N</math> (the number of ''loops''). It follows
-exactly one wire and in at most one cell: we say <math>p</math> is ''free'' if it is
+from the definitions that each port <math>p\in P</math> appears in exactly one wire and in
-not part of a cell, and <math>p</math> is ''internal'' otherwise. We write <math>\textrm{fp}(R)</math> for
+at most one cell: we say <math>p</math> is ''free'' if it is not part of a cell, and
-the set of free ports of a net <math>R</math>.
+<math>p</math> is ''internal'' otherwise. Moreover, we say <math>p</math> is ''dangling'' if
+<math>p</math> is free and <math>W(p)</math> is internal. We write <math>\textrm{fp}(R)</math> for the set of
+free ports of a net <math>R</math>.
 Generally, the “names” of internal ports of a net are not relevant, but free
@@ Line 119: / Line 119: @@
 * for all <math>p\in P</math>, <math>W'(\phi(p))=\phi(W(p))</math>;
 * for all <math>c\in C</math>:
+* <math>L=L'</math>.
 Observe that under these conditions  <math>\psi</math> is uniquely induced by <math>\phi</math>.
 We say that the isomorphism <math>\phi</math> is ''nominal'' if moreover <math>p\in\textrm{fp}(R)</math>
 implies <math>p=\phi(p)</math>.
-=== Rewriting ===
+=== Subnets ===
 We say two nets are disjoint when their sets of ports are.
@@ Line 130: / Line 131: @@
 <math>I\subseteq \textrm{fp}(R)</math> and <math>I'\subseteq \textrm{fp}(R')</math>.
 We then write <math>R\bowtie_f{R'}</math> for the net
-with wiring <math>W\bowtie_f{W'}</math> and cells
+with wiring <math>W\bowtie_f{W'}</math>, cells
-<math>C\cup C'</math>.
+<math>C\cup C'</math> and loops <math>\Inner{R}{R'}_f=L+L'+\Inner{W}{W'}_f</math>.
+We say this connection is ''orthogonal'' if <math>\Inner{W}{W'}_f=0</math>, and it is
+''modular'' if the ports in <math>I\cup I'</math> are all dangling: a modular connection is
+always orthogonal.
+We say <math>R_0</math> is a ''subnet'' of <math>R</math>, if there exists a net <math>R'</math> and a connection
+<math>(I,I',f)</math> between <math>R_0</math> and <math>R'</math> such that <math>R=R_0\bowtie_f{R'}</math>.
 {{Lemma|
@@ Line 142: / Line 143: @@
 <math>R_1\bowtie_{f\circ\phi^{-1}}{R'}</math>.
 }}
+=== Rewriting ===
 A ''net rewriting rule'' is a pair <math>(r_0,r_1)</math> of nets

A formal account of nets

Revision as of 09:50, 6 September 2012

Contents

Preliminaries

The short story

Nets

Wires

Nets

Subnets

Rewriting

Typing

Boxes

Views

Personal tools

Navigation

Search

Tools