Categorical fixed point calculus

DOI10.1007/3-540-60164-3_25zbMath1502.68168OpenAlexW1859242033MaRDI QIDQ5057473

Jaap van der Woude, Marcel Bijsterveld, Rik van Geldrop, Roland C. Backhouse

Publication date: 16 December 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60164-3_25

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Related Items

Monads for behaviour, A categorical framework for congruence of applicative bisimilarity in higher-order languages, Equational properties of iteration in algebraically complete categories, The equational logic of fixed points, Structured handling of scoped effects, Unifying structured recursion schemes, Unnamed Item, Induction, Coinduction, and Adjoints, List Objects with Algebraic Structure, Partially ordered objects in a topos

Cites Work

• Fixed-point calculus
• Data structures and program transformation
• Programming languages and their definition. Selected papers ed. by C. B. Jones
• Calculate categorically!
• Constructive versions of Tarski's fixed point theorems
• A fixpoint theorem for complete categories
• Algebraic specification of data types: A synthetic approach
• Least fixpoints of endofunctors of cartesian closed categories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item