Non-deterministic algebraic rewriting as adjunction

DOI10.1016/J.APAL.2026.103782MaRDI QIDQ7262814zbMATH OpenFDO

Authors Răzvan Diaconescu

Publication date 12 June 2026

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APAL.2026.103782

zbMATH Keywords

non-determinismpreordered algebrarewritinguniversal properties

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of model theory (03C98) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65) Symbolic computation and algebraic computation (68W30)

Cites work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• An institution-independent proof of the Robinson consistency theorem
• An Oxford survey of order sorted algebra
• Birkhoff completeness in institutions
• CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
• Coinduction for preordered algebra
• Completeness by forcing
• Conditional rewriting logic as a unified model of concurrency
• Elementary Diagrams in Institutions
• Foundations of algebraic specification and formal software development.
• Generalized rewrite theories, coherence completion, and symbolic methods
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 3714904 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1231673 (Why is no real title available?)
• scientific article; zbMATH DE number 1998330 (Why is no real title available?)
• scientific article; zbMATH DE number 2196612 (Why is no real title available?)
• Institution-independent model theory (to appear)
• Institutions: abstract model theory for specification and programming
• Integrating Maude into Hets
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Logical foundations of CafeOBJ
• On the algebra of structured specifications
• The calculus of constructions

This page was built for publication: Non-deterministic algebraic rewriting as adjunction

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