A Coalgebraic View of Bar Recursion and Bar Induction

DOI10.1007/978-3-662-49630-5_6zbMath1474.03105OpenAlexW2437461174MaRDI QIDQ2811334

Venanzio Capretta, Tarmo Uustalu

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/33872/1/Barred_Coalgebras_FOSSACS2016.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Higher-type and set recursion theory (03D65)

Related Items (1)

Higher order functions and Brouwer’s thesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categorical set theory: A characterization of the category of sets
• Recursive coalgebras from comonads
• Containers: Constructing strictly positive types
• Well-Pointed Coalgebras
• Representations of Stream Processors Using Nested Fixed Points
• Recursive coalgebras of finitary functors
• Selection functions, bar recursion and backward induction
• Corecursive Algebras: A Study of General Structured Corecursion
• On the computational content of the axiom of choice
• The temporal logic of coalgebras via Galois algebras
• The inconsistency of a Brouwerian continuity principle with the Curry-Howard interpretation
• Modified bar recursion
• Intuitionistic sets and ordinals
• Types for Proofs and Programs

This page was built for publication: A Coalgebraic View of Bar Recursion and Bar Induction