scientific article
DOI10.23638/LMCS-13(1:3)2017zbMATH Open1451.68181arXiv1609.08367MaRDI QIDQ2980965FDOQ2980965
Jan J. M. M. Rutten, Helle Hvid Hansen, Clemens Kupke
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1609.08367
Title of this publication is not available (Why is that?)
linear systemscoalgebraautomatic sequencescoinductionbialgebrastreamsbehavioural differential equationscontext-free streams
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- CIRC: A Circular Coinductive Prover
- Derivatives of Regular Expressions
- Universal coalgebra: A theory of systems
- Structural operational semantics.
- On the Final Coalgebra of Automatic Sequences
- Coalgebraic Bisimulation-Up-To
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Automatic Sequences and Zip-Specifications
- Representations of Stream Processors Using Nested Fixed Points
- Rational streams coalgebraically
- Automatic Sequences
- A coinductive calculus of streams
- Bialgebras for structural operational semantics: an introduction
- Category theory for operational semantics
- A coalgebraic perspective on linear weighted automata
- A tutorial on coinductive stream calculus and signal flow graphs
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- A New Representation of the Rational Numbers for Fast Easy Arithmetic
- Distributive laws for the coinductive solution of recursive equations
- Presenting Distributive Laws
- Generalised coinduction
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Bialgebraic methods and modal logic in structural operational semantics
- Well-definedness of streams by transformation and termination
- Productivity of Stream Definitions
- Lazy productivity via termination
- Complete sets of cooperations
- Well-behaved translations between structural operational semantics
- Elements of Stream Calculus
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- (Co)Algebraic Characterizations of Signal Flow Graphs
- Algebra and Coalgebra in Computer Science
- Coalgebraic characterizations of context-free languages
- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
- Productive coprogramming with guarded recursion
- A proof of Moessner's theorem by coinduction
- Concrete stream calculus: An extended study
- Context-free coalgebras
- Defining Context-Free Power Series Coalgebraically
- Newton Series, Coinductively
- Language Constructs for Non-Well-Founded Computation
- Wellfounded recursion with copatterns
- A Final Coalgebra for k-regular Sequences
Cited In (6)
- An implicit function theorem for the stream calculus
- Companions, Codensity and Causality
- Coinduction in Flow: The Later Modality in Fibrations
- Distributive laws for monotone specifications
- Integrating induction and coinduction via closure operators and proof cycles
- Products, polynomials and differential equations in the stream calculus
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980965)
