From 11f14a4763533dbc24b0e98d115071036025d4f6 Mon Sep 17 00:00:00 2001
From: ericmarin <maarin.eric@gmail.com>
Date: Mon, 22 Jun 2026 00:43:45 +0200
Subject: refinement

---
 chapters/core/implementation/01-inpla.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'chapters/core/implementation/01-inpla.tex')

diff --git a/chapters/core/implementation/01-inpla.tex b/chapters/core/implementation/01-inpla.tex
index eeebf47..57d3195 100644
--- a/chapters/core/implementation/01-inpla.tex
+++ b/chapters/core/implementation/01-inpla.tex
@@ -1,7 +1,7 @@
 \subsection{INPLA fork}
 \label{sec:inpla}
 
-The VEIN reduction engine utilizes a modified version of INPLA\footnote{\textbf{\href{https://github.com/inpla/inpla/blob/main/Gentle_introduction_Inpla.md}{INPLA documentation.}}},
+The \textbf{VEIN} reduction engine utilizes a modified version of INPLA\footnote{\textbf{\href{https://github.com/inpla/inpla/blob/main/Gentle_introduction_Inpla.md}{INPLA documentation.}}},
 a multi-threaded parallel interpreter of IN. Performance and ease of use motivated the choice of
 INPLA. Additionally, it supports attribute values, which is a special extension that allows agents
 to hold numerical values at their ports.
@@ -24,7 +24,7 @@ INPLA evaluates nets which consist of connections between terms. Terms are built
 <term> ::= <name> | <agent>
 <name> ::= <nameID>
 <agent> ::= <agentID>
-					| <agentID> ['(' <term> ',' ... ',' <term> ')']
+          | <agentID> ['(' <term> ',' ... ',' <term> ')']
 \end{verbatim}
 \end{small}
 \begin{itemize}
@@ -37,12 +37,12 @@ Interaction rules rewrite connections between agents:
 \begin{verbatim}
 <interaction-rule> ::= <rule-agent> '><' <rule-agent> '=>' <connections> ';'
 <rule-agent> ::= <agentID>
-							 | <agentID> '(' <name> ',' ... ',' <name> ')'
+               | <agentID> '(' <name> ',' ... ',' <name> ')'
 \end{verbatim}
 \end{small}
 
 \paragraph{Example}
-Unary natural numbers are built by $\texttt{Z}$ (zero) and $\texttt{S}$ (successive function). For
+Unary natural numbers are built by $\texttt{Z}$ (zero) and $\texttt{S}$ (successor function). For
 instance, 0, 1, 2, 3 are expressed as \texttt{Z}, \texttt{S(Z)}, \texttt{S(S(Z))}, \texttt{S(S(S(Z)))}. Here, let's think about an
 increment operation ``inc'' such that:
 \begin{small}
-- 
cgit v1.2.3

