Unique fixed points vs. least fixed points
From MaRDI portal
Publication:1142573
DOI10.1016/0304-3975(80)90056-0zbMath0439.68026OpenAlexW2077884383MaRDI QIDQ1142573
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(80)90056-0
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (30)
Complete Iterativity for Algebras with Effects ⋮ Algebraic solutions to recursion schemes ⋮ Unnamed Item ⋮ How iterative reflections of monads are constructed ⋮ Solving polynomial fixed point equations ⋮ The equational logic of fixed points ⋮ Equational properties of iterative monads ⋮ Infinite trees and completely iterative theories: A coalgebraic view ⋮ Sets with structure, mappings and fixed point property: fixed point structures ⋮ Base modules for parametrized iterativity ⋮ Recursion-closed algebraic theories ⋮ Unnamed Item ⋮ On functors preserving coproducts and algebras with iterativity ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Algebras with parametrized iterativity ⋮ Iterative reflections of monads ⋮ A Coalgebraic View of Infinite Trees and Iteration ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Fixing Zeno gaps ⋮ Completely iterative algebras and completely iterative monads ⋮ A Description of Iterative Reflections of Monads (Extended Abstract) ⋮ On algebras with effectful iteration ⋮ Bases for parametrized iterativity ⋮ Group axioms for iteration ⋮ On Iteratable Endofunctors ⋮ Algebras of iteration theories ⋮ Iterative factor algebras and induced metrics ⋮ Extensions of iterative congruences of free iterative algebras ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees
Cites Work
This page was built for publication: Unique fixed points vs. least fixed points
