All traditional implementation techniques for functional languages fail to avoid useless
repetition of work. They are not" optimal" in their implementation of sharing, often causing a …

This paper develops a formal string diagram language for monoidal closed categories.
Previous work has shown that string diagrams for freely generated symmetric monoidal …

We enhance the calculus of string diagrams for monoidal categories with hierarchical
features in order to capture closed monoidal (and cartesian closed) structure. Using this new …

We present a simple term calculus with an explicit control of erasure and duplication of
substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment …

We introduce subatomic proof theory, a new methodology where, by looking inside atoms,
we are able to represent a wide variety of proof systems in such a way that every rule is an …

Typing of lambda-terms in elementary and light affine logic (EAL and LAL, respectively) has
been studied for two different reasons: on the one hand the evaluation of typed terms using …

Approach to synthesis of modular structure of a subsystem of information security of the
automated process control system is offered. The task has been solved on the basis of a set …

A tree can be compressed into a DAG by sharing common subtrees. The resulting DAG is at
most exponentially smaller than the original tree. Consider an attribute grammar that …

We study encodings of the λ-calculus into the π-calculus in the unexplored case of calculi
with non-determinism and failures. On the sequential side, we consider λ^↯ _⊕, a new non …

Sharing graphs are an implementation of linear logic proof-nets in which a redex is never
duplicated. In their usual formulation, sharing graphs present a problem of coherence: if the …