A coalgebraic view of bar recursion and bar induction
From MaRDI portal
Publication:2811334
Recommendations
- Equivalence of bar induction and bar recursion for continuous functions with continuous moduli
- On Spector's bar recursion
- Characterising Brouwer's continuity by bar recursion on moduli of continuity
- Bar induction. The good, the bad, and the ugly
- Selection functions, bar recursion and backward induction
Cites work
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 3552491 (Why is no real title available?)
- scientific article; zbMATH DE number 1478228 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- scientific article; zbMATH DE number 3231083 (Why is no real title available?)
- Categorical set theory: A characterization of the category of sets
- Containers: Constructing strictly positive types
- Continuous functions on final coalgebras
- Corecursive algebras: a study of general structured corecursion
- Intuitionistic sets and ordinals
- Modified bar recursion
- On the computational content of the axiom of choice
- Recursive coalgebras from comonads
- Recursive coalgebras of finitary functors
- Representations of stream processors using nested fixed points
- Selection functions, bar recursion and backward induction
- The inconsistency of a Brouwerian continuity principle with the Curry-Howard interpretation
- The temporal logic of coalgebras via Galois algebras
- Types for Proofs and Programs
- Well-pointed coalgebras
Cited in
(4)
This page was built for publication: A coalgebraic view of bar recursion and bar induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811334)