Least Fixed Point of a Functor

We exhibit a con- struction of the LFP, generalizing the Knaster-Tarski formula lub(F”(O)},,, : lubs are substituted by well-ordered colimits and n is allowed to be an arbitrary ordinal. Related LFP constructions, always restricted to 1z E w, have been considered by various authors [6, 11, 13, 141. The advantage of the present approach is its effectiveness: Whenever a functor

• Publication year

  1979

• Venue

  Journal of computer and system sciences (Print)

• Publication date

  1979-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0022-0000(79)90026-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• FIxED 4 ? OINT CONSTRUCTIONS IN ORDER-ENRKHED CATEGORIES *

  2001cited by this paper
• CATEGORICAL CONSTRUCTIONS OF FREE ALGEBRAS, COLIMITS, AND COMPLETIONS OF PARTIAL ALGEBRAS

  1979cited by this paper
• The category-theoretic solution of recursive domain equations

  1977cited by this paper
• Remarks on Fixed Points of Functors

  1977cited by this paper
• Realization theory for automata in categories

  1977cited by this paper
• Free Dynamic and Algebraic Semantics

  1977cited by this paper
• Free algebras, input processes and free monads

  1975cited by this paper
• On minimal realizations of behavior maps in categorial automata theory

  1974cited by this paper
• MACHINES IN A CATEGORY: AN EXPOSITORY INTRODUCTION*

  1974cited by this paper
• Free algebras and automata realizations in the language of categories

  1974cited by this paper
• Toposes, Algebraic Geometry and Logic

  1972cited by this paper
• The colimits in the generalized algebraic categories

  1972cited by this paper
• On descriptive classification of set-functors. II.

  1971cited by this paper
• Some properties of set functors

  1969cited by this paper
• A fixpoint theorem for complete categories

  1968cited by this paper

• Topology-free type structures with conditioning events

  2022cites this paper
• Grounding Game Semantics in Categorical Algebra

  2022cites this paper
• Toward a Coalgebraic Model of Control Programs

  2022cites this paper
• CHAD for expressive total languages

  2021cites this paper
• Category

  2020cites this paper
• Partially ordered objects in a topos

  2020cites this paper
• On Terminal Coalgebras Derived from Initial Algebras

  2019cites this paper
• 8th Conference on Algebra and Coalgebra in Computer Science, CALCO 2019, June 3-6, 2019, London, United Kingdom.

  2019cites this paper
• The Way of the Dagger

  2019influential citation
• Algebraic cocompleteness and finitary functors

  2019cites this paper
• Categorical Buechi and Parity Conditions via Alternating Fixed Points of Functors

  2018cites this paper
• L O ] 3 M ar 2 01 6 A representation theorem for stratified complete lattices

  2018cites this paper
• Quotient inductive-inductive definitions

  2017cites this paper
• Initial Algebra for a System of Right-Linear Functors

  2017cites this paper
• Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective

  2016cites this paper
• $\mu$-Bicomplete Categories and Parity Games

  2016cites this paper
• Quotient inductive-inductive types

  2016cites this paper
• Coalgebraic Trace Semantics for Buechi and Parity Automata

  2016cites this paper
• A Representation Theorem for Stratified Complete Lattices

  2015cites this paper
• Logical aspects of quantum computation

  2015cites this paper
• Coalgebraic Infinite Traces and Kleisli Simulations

  2015cites this paper
• Finitary logics for coalgebras with branching

  2012cites this paper
• Connections of coalgebra and semantic modeling

  2011cites this paper
• Tracing Anonymity with Coalgebras

  2008cites this paper
• Generic Trace Semantics via Coinduction

  2007cites this paper
• Generic Trace Theory

  2006cites this paper
• Finitary coalgebraic logics

  2006cites this paper
• On the final sequence of a finitary set functor

  2005cites this paper
• Representing Nested Inductive Types Using W-Types

  2004cites this paper
• Equational properties of iteration in algebraically complete categories

  2003cites this paper
• Foundations of Software Science and Computation Structures: 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings

  2003cites this paper
• Testing Labelled Markov Processes

  2002cites this paper
• µ-Bicomplete Categories and Parity Games

  2002cites this paper
• Semantics of Constructions (II) ─ The Initial Algebraic Approach

  2001influential citation
• A Calculus of Circular Proofs and Its Categorical Semantics

  2001cites this paper
• When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?

  1998cites this paper
• The Equational Logic of Fixed Points (Tutorial)

  1997cites this paper
• Equational Properties of Iteration in Algebraically Complete Categories

  1996cites this paper
• On the Greatest Fixed Point of a Set Functor

  1995cites this paper
• Uncountable Limits and the lambda Calculus

  1995influential citation
• Countable Non-Determinism and Uncountable Limits

  1994cites this paper
• On injectivity in locally presentable categories

  1993cites this paper
• Some economic applications of Scott domains

  1992cites this paper
• On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders

  1992cites this paper
• Infinite Hypergraphs I. Basic Properties

  1991cites this paper
• Graph Rewriting: An Algebraic and Logic Approach

  1991cites this paper
• The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs

  1990cites this paper
• Recursively Defined Types in Constructive Type Theory

  1989cites this paper
• The Definability of Equational Graphs in Monadic Second-Order Logic

  1989cites this paper
• On Systems of Equations Defining Infinite Graphs

  1988cites this paper
• The Metric Closure Powerspace Construction

  1987influential citation
• Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits

  1985cites this paper
• The Category-Theoretic Solution of Recursive Domain Equations

  1982cites this paper
• Parametrized Data Types Do Not Need Highly Constrained Parameters

  1982cites this paper
• A Powerdomain for Countable Non-Determinism (Extended Abstract)

  1982cites this paper
• Varietors and machines in a category

  1981cites this paper