Discrete Lawvere theories and monads

Mathematical Structures in Computer Science 2026 Open access

Read full text
Authors: Jiřı́ Rosický
DOI: 10.1017/s0960129525100443
Cited by: 0
References: 15

Abstract

Abstract We show that, under certain assumptions, strongly finitary enriched monads are given by discrete enriched Lawvere theories. On the other hand, monads given by discrete enriched Lawvere theories preserve surjections.

Fields of Study & Subjects

Computational Geometry and Mesh Generation

Publication details

Journal / source
Mathematical Structures in Computer Science
Publisher
Cambridge University Press (CUP)
Volume
36
Publication date
1 January 2026
Language
EN