Cover Image

Colimit-Based Composition of High-Level Computing Devices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Arellanes, Damian
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Models of High-Level Computation
by: Arellanes, Damian
Published: (2024)

Compositional Control-Driven Boolean Circuits
by: Arellanes, Damian
Published: (2025)

Coslice Colimits in Homotopy Type Theory
by: Hart, Perry, et al.
Published: (2024)

On the Computability of Measures of Regular Sets of Infinite Trees
by: Niwiński, Damian, et al.
Published: (2023)

Compositional Reversible Computation
by: Carette, Jacques, et al.
Published: (2024)

Compositional Separation of Control Flow and Data Flow
by: Arellanes, Damian
Published: (2023)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
by: Mannucci, Mirco A., et al.
Published: (2025)

A Dichotomy Theorem for Ordinal Ranks in MSO
by: Niwiński, Damian, et al.
Published: (2025)

Resource-Bounded Martin-Löf Type Theory: Compositional Cost Analysis for Dependent Types
by: Mannucci, Mirco A., et al.
Published: (2026)

Computation and Complexity of Preference Inference Based on Hierarchical Models
by: Wilson, Nic, et al.
Published: (2024)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

Base-extension Semantics for Modal Logic
by: Eckhardt, Timo, et al.
Published: (2024)

The Internal Logic and Finite Colimits
by: Troiani, William
Published: (2025)

Base-extension Semantics for Intuitionistic Modal Logics
by: Buzoku, Yll, et al.
Published: (2025)

Concrete Security Bounds for Simulation-Based Proofs of Multi-Party Computation Protocols
by: Sojakova, Kristina, et al.
Published: (2025)

Compositional Confluence Criteria
by: Shintani, Kiraku, et al.
Published: (2023)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
by: De Domenico, Andrea, et al.
Published: (2024)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

Computation and Concurrency
by: Wang, Yong
Published: (2024)

Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)

Compositional Value Iteration with Pareto Caching
by: Watanabe, Kazuki, et al.
Published: (2024)

Coco: Corecursion with Compositional Heterogeneous Productivity
by: Kim, Jaewoo, et al.
Published: (2025)

Compositional Taylor expansion in cartesian differential categories
by: Walch, Aymeric
Published: (2025)

Computational Complexity of Standpoint LTL
by: Demri, Stéphane, et al.
Published: (2024)

Symbolic Computation for All the Fun
by: Brown, Chad E., et al.
Published: (2024)

An Axiomatic Theory for Reversible Computation
by: Lanese, Ivan, et al.
Published: (2023)

Algorithmic Problems for Computation Trees
by: Moshkov, Mikhail
Published: (2025)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

Pairwise Independence of Representation, Classification, and Composition in Finite Extensional Magmas
by: Palmieri, Stefano
Published: (2026)

Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
by: Di Guardia, Rémi, et al.
Published: (2026)

FORWORD: Accelerating Formal Datapath Verification via Word-Level Sweeping
by: Yang, Ziyi, et al.
Published: (2025)

Compositional Interface Refinement Through Subtyping in Probabilistic Session Types
by: Blechschmidt, Paula
Published: (2025)

Compositional Inductive Invariant Inference via Assume-Guarantee Reasoning
by: Dardik, Ian, et al.
Published: (2025)

Asynchronous Composition of LTL Properties over Infinite and Finite Traces
by: Bombardelli, Alberto, et al.
Published: (2023)

Compositional pre-processing for automated reasoning in dependent type theory
by: Blot, Valentin, et al.
Published: (2022)