2012/01/01 by Jean‐Guillaume Dumas, Dumas, Jean-Guillaume, Dominique Duval +5
Computer Science · #Advanced Algebra and Logic #Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1207.1255
openalex publication_date 2012/07/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended semantics. We solve this apparent contradiction by efining a logic for exceptions with a proof system which is close to their syntax and where their intended semantics can be seen as a model. This requires a robust framework for logics and their morphisms, which is provided by categorical tools relying on adjunctions, fractions and limit sketches.