Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models

Dorel Lucanu
(Alexandru Ioan Cuza University of Iasi, Romania)

In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.

In Horaţiu Cheval, Laurenţiu Leuştean and Andrei Sipoş: Proceedings 7th Symposium on Working Formal Methods (FROM 2023), Bucharest, Romania, 21-22 September 2023, Electronic Proceedings in Theoretical Computer Science 389, pp. 41–55.
Published: 22nd September 2023.
ArXived at: https://dx.doi.org/10.4204/EPTCS.389.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org