Computational paths -- a weak groupoid

DOI10.1093/LOGCOM/EXAD071MaRDI QIDQ6915740zbMATH OpenFDO

Authors Tiago M. L. de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina de Oliveira

Publication date 15 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAD071

zbMATH Keywords

algebraic topologycategory theorycomputational pathslabelled natural deductionterm rewriting system

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• -groupoid generated by an arbitrary topological -model
• A normalization procedure for the equational fragment of labelled natural deduction
• A Proof-Theoretic Account of Programming and the Role of Reduction Rules
• Abstract Data Types and Type Theory: Theories as Types
• Conditional rewriting logic as a unified model of concurrency
• Failure of completeness in proof-theoretic semantics
• Homotopy theoretic models of identity types
• Homotopy type theory. Univalent foundations of mathematics
• scientific article; zbMATH DE number 5318491 (Why is no real title available?)
• scientific article; zbMATH DE number 3910392 (Why is no real title available?)
• Natural Deduction for Equality: The Missing Entity
• On the identity type as the type of computational paths
• Orderings for term-rewriting systems
• Proof theory and computer programming
• The Theory of an Arbitrary Higher -Model
• Towards a homotopy domain theory

This page was built for publication: Computational paths -- a weak groupoid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915740)