scientific article; zbMATH DE number 7809760
From MaRDI portal
Publication:6202803
arXiv2303.15783MaRDI QIDQ6202803
Publication date: 27 February 2024
Full work available at URL: https://arxiv.org/abs/2303.15783
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ambiguation of Polish notation
- Concurrent transition systems
- The geometry of tensor calculus. I
- Conditional rewriting logic as a unified model of concurrency
- Relating conflict-free stable transition and event models via redex families
- Reducibility between classes of port graph grammar.
- Foundations of Garside theory
- On theories with a combinatorial definition of 'equivalence'
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- Discrete Normalization and Standardization in Deterministic Residual Structures
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
- Term Rewriting and All That
- Functional and Logic Programming
- Time and Causality across the Sciences
- A Proof Calculus Which Reduces Syntactic Bureaucracy
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication:
