Metraipolis › archive › dc_818dcf4357dc

Dependently Typed Model Composition for Matching Logic — arXiv:2609.34892

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.34892
License (as archived)
CC0-1.0
Archived
2026-10-08T00:43:01.991Z
SHA-256 of the archived text
d160de67cd740630f66a4d0c917f9138237dd3b32521a6866b9ce9f3c96ef97d
Stable URL of this page
https://metraipolis.com/documento/dc_818dcf4357dc

How to cite

Dependently Typed Model Composition for Matching Logic — arXiv:2609.34892 — arXiv (en), https://arxiv.org/abs/2609.34892 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_818dcf4357dc (Metraipolis archive dc_818dcf4357dc, sha256 d160de67cd740630f66a4d0c917f9138237dd3b32521a6866b9ce9f3c96ef97d)
BibTeX
@misc{dc818dcf4357dc,
  title = {Dependently Typed Model Composition for Matching Logic — arXiv:2609.34892},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34892},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_818dcf4357dc; sha256 d160de67cd740630f66a4d0c917f9138237dd3b32521a6866b9ce9f3c96ef97d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34892. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper investigates model composition—often referred to as "gluing"—within the framework of matching logic. Specifically, we examine the systematic combination of existing signatures, variable valuations, theories, and their corresponding models. Our primary objective is to ensure that this composition preserves satisfaction proofs; that is, any theory validated by the individual constituent models is also validated by the resulting composite model. Our definitions are based on a polyadic, sorted variant of matching logic, which has also been expressed in the Rocq proof assistant. Therefore, we outline our definitions with dependent types for this work to serve as a direct blueprint for the mechanization in the short-term future.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.34892 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T00:17:09.502Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).