Fundamentals of Compositional Rewriting Theory

04/14/2022
by   Nicolas Behr, et al.
0

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and structure intrinsically the large collection of lemmata used in the proofs of theorems such as concurrency and associativity. The resulting highly generic proofs of these theorems are given; it is noteworthy that the proof of the concurrency theorem takes only a few lines and, while that of associativity remains somewhat longer, it would be unreadably long if written directly in terms of the basic lemmata. In addition to improving, or even enabling, the readability of human-written proofs, we anticipate that this more generic and modular style of writing proofs should organize and inform the production of formalized proofs in a proof assistant such as Coq or Isabelle. A curated list of known instances of our framework is used to conclude the paper with a detailed discussion of the conditions under which the Double Pushout and Sesqui-Pushout semantics of graph transformation are compositional.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2016

Finding Proofs in Tarskian Geometry

We report on a project to use a theorem prover to find proofs of the the...
research
12/22/2022

Towards Mechanised Proofs in Double-Pushout Graph Transformation

We formalise the basics of the double-pushout approach to graph transfor...
research
05/08/2014

Proofs of two Theorems concerning Sparse Spacetime Constraints

In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...
research
02/21/2019

The Power of Self-Reducibility: Selectivity, Information, and Approximation

This chapter provides a hands-on tutorial on the important technique kno...
research
02/27/2018

Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables

This paper studies specifications and proofs of distributed algorithms w...
research
01/08/2020

An Equational Theory for Weak Bisimulation via Generalized Parameterized Coinduction

Coinductive reasoning about infinitary structures such as streams is wid...
research
03/12/2023

MizAR 60 for Mizar 50

As a present to Mizar on its 50th anniversary, we develop an AI/TP syste...

Please sign up or login with your details

Forgot password? Click here to reset