Related papers: Towards a homotopy theory of process algebra
While high-level data parallel frameworks, like MapReduce, simplify the design and implementation of large-scale data processing systems, they do not naturally or efficiently support many important data mining and machine learning…
With the increase of the search for computational models where the expression of parallelism occurs naturally, some paradigms arise as options for the next generation of computers. In this context, dynamic Dataflow and Gamma - General…
Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using…
We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between `lambda-higher-order term graphs' (lambda-ho-term-graphs), which are first-order term graphs endowed…
Writing high performance solvers for engineering applications is a delicate task. These codes are often developed on an application to application basis, highly optimized to solve a certain problem. Here, we present our work on developing a…
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally…
An appropriate framework is put forward for the construction of $\lambda$-models with $\infty$-groupoid structure, which we call \textit{homotopic $\lambda$-models}, through the use of an $\infty$-category with cartesian closure and enough…
We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…
Generative modelling has seen significant advances through simulation-free paradigms such as Flow Matching, and in particular, the MeanFlow framework, which replaces instantaneous velocity fields with average velocities to enable efficient…
Topological Data Analysis (TDA) is a rising field of computational topology in which the topological structure of a data set can be observed by persistent homology. By considering a sequence of sublevel sets, one obtains a filtration that…
Recently, we introduced the notion of flow (depending on time) of finite-dimensional algebras. A flow of algebras (FA) is a particular case of a continuous-time dynamical system whose states are finite-dimensional algebras with (cubic)…
Naturally occurring diagrams in algebraic topology are commutative up to homotopy, but not on the nose. It was quickly realized that very little can be done with this information. Homotopy coherent category theory arose out of a desire to…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We proved in a previous work that Cattani-Sassone's higher dimensional transition systems can be interpreted as a small-orthogonality class of a topological locally finitely presentable category of weak higher dimensional transition…
We introduce a very general approach to the analysis of signals from their noisy measurements from the perspective of Topological Data Analysis (TDA). While TDA has emerged as a powerful analytical tool for data with pronounced topological…
Motivated by the Hamilton's Ricci flow, we define the homogeneous flow of a parallelizable manifold and show the long time existence and uniqueness of its solutions on $[0,\infty).$ Using this flow, we outline a simple proof of the Poincare…
The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…
In process algebras such as ACP (Algebra of Communicating Processes), parallel processes are considered to be interleaved in an arbitrary way. In the case of multi-threading as found in contemporary programming languages, parallel processes…
In previous works by the authors, a bifunctor was associated to any operadic twisting morphism, taking a coalgebra over a cooperad and an algebra over an operad, and giving back the space of (graded) linear maps between them endowed with a…