Cover Image

Algebras for Deterministic Computation Are Inherently Incomplete

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cate, Balder ten, Kappé, Tobias
Format:	Preprint
Published:	2024
Subjects:	Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Partial Reductions for Kleene Algebra with Linear Hypotheses
by: Chung, Liam, et al.
Published: (2026)

Kleene Algebra
by: Kappé, Tobias, et al.
Published: (2025)

On Propositional Program Equivalence (extended abstract)
by: Kappé, Tobias
Published: (2025)

A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests
by: Kappé, Tobias, et al.
Published: (2023)

An Elementary Proof of the FMP for Kleene Algebra
by: Kappé, Tobias
Published: (2022)

Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization
by: Soeteman, Arie, et al.
Published: (2025)

Craig Interpolation for Decidable First-Order Fragments
by: Cate, Balder ten, et al.
Published: (2023)

Characterising Modal Formulas with Examples
by: Cate, Balder ten, et al.
Published: (2023)

Interpolation in First-Order Logic
by: Cate, Balder ten, et al.
Published: (2025)

CF-GKAT: Efficient Validation of Control-Flow Transformations
by: Zhang, Cheng, et al.
Published: (2024)

On the Power and Limitations of Examples for Description Logic Concepts
by: Cate, Balder ten, et al.
Published: (2024)

Query Repairs
by: Cate, Balder ten, et al.
Published: (2025)

Six Proofs of Interpolation for the Modal Logic K
by: Bezhanishvili, Nick, et al.
Published: (2025)

The Size of Interpolants in Modal Logics
by: Cate, Balder ten, et al.
Published: (2025)

StacKAT: Infinite State Network Verification
by: Jacobs, Jules, et al.
Published: (2025)

Universal Algebra and Effectful Computation
by: Rajesh, Nayan
Published: (2025)

When do modal definability and preservation theorems transfer to the finite?
by: van Benthem, Johan, et al.
Published: (2026)

Introducing Linear Implication Types to $λ_{GT}$ for Computing With Incomplete Graphs
by: Sano, Jin, et al.
Published: (2025)

Compressing Structured Tensor Algebra
by: Ghorbani, Mahdi, et al.
Published: (2024)

Characterizing LTL Formulas by Examples
by: Cate, Balder ten, et al.
Published: (2026)

Extremal Fitting Problems for Conjunctive Queries
by: Cate, Balder ten, et al.
Published: (2022)

How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
by: Soeteman, Arie, et al.
Published: (2026)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
by: Cate, Balder ten, et al.
Published: (2025)

Modal Fragments
by: Bezhanishvili, Nick, et al.
Published: (2026)

Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
by: Yuan, Charles
Published: (2025)

PSM: Policy Synchronised Deterministic Memory
by: Mendler, Michael, et al.
Published: (2025)

The Algebra of Patterns (Extended Version)
by: Binder, David, et al.
Published: (2025)

PIP: Making Andersen's Points-to Analysis Sound and Practical for Incomplete C Programs
by: Krogstie, Håvard Rognebakke, et al.
Published: (2025)

Static Analysis Under Non-Deterministic Program Assumptions
by: Rasheed, Abdullah H.
Published: (2026)

Range Algebra for Safe Array Splits
by: Perisic, Aleksandar
Published: (2014)

We've Got You Covered: Type-Guided Repair of Incomplete Input Generators
by: LaFontaine, Patrick, et al.
Published: (2025)

The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation
by: Haynes, Houston
Published: (2026)

CuTe Layout Representation and Algebra
by: Cecka, Cris
Published: (2026)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

A General Completeness Theorem for Skip-free Star Algebras
by: Kappé, Tobias, et al.
Published: (2025)

TPDE: A Fast Adaptable Compiler Back-End Framework
by: Schwarz, Tobias, et al.
Published: (2025)

Fast Deterministic Black-box Context-free Grammar Inference
by: Arefin, Mohammad Rifat, et al.
Published: (2023)

Deterministic Fully-Static Whole-Binary Translation without Heuristics
by: Chen, Hongyu, et al.
Published: (2026)

A Compute-Matched Re-Evaluation of TroVE on MATH
by: Sesterhenn, Tobias, et al.
Published: (2025)

Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution
by: Chougule, Atharva, et al.
Published: (2026)