Foundations of regular coinduction
Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a middle way interpretation, called regular, which combines advant...
Main Author: | Francesco Dagnino |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2021-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/6553/pdf |
Similar Items
-
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
by: Jörg Endrullis, et al.
Published: (2018-01-01) -
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
by: Clemens Grabmayer
Published: (2023-06-01) -
Expressive Logics for Coinductive Predicates
by: Clemens Kupke, et al.
Published: (2021-12-01) -
Indexed Induction and Coinduction, Fibrationally
by: Neil Ghani, et al.
Published: (2013-08-01) -
An operational interpretation of coinductive types
by: Łukasz Czajka
Published: (2020-02-01)