Pages that link to "Item:Q5310638"

The following pages link to General Recursion via Coinductive Types (Q5310638):

Displaying 38 items.

• Monads for behaviour (Q265824) (← links)
• The coinductive resumption monad (Q283770) (← links)
• A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
• Coalgebras in functional programming and type theory (Q639643) (← links)
• Terminating general recursion (Q1112584) (← links)
• General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
• Typing total recursive functions in Coq (Q1687755) (← links)
• Complete Elgot monads and coalgebraic resumptions (Q1744384) (← links)
• Another look at function domains (Q2805150) (← links)
• Inductive, coinductive, and pointed types (Q2817688) (← links)
• Inductive and coinductive components of corecursive functions in Coq (Q2873661) (← links)
• Turing-Completeness Totally Free (Q2941179) (← links)
• Global semantic typing for inductive and coinductive computing (Q2958539) (← links)
• Unifying Guarded and Unguarded Iteration (Q2988389) (← links)
• Partiality, Revisited (Q2988390) (← links)
• Partiality, State and Dependent Types (Q3007667) (← links)
• A Coinductive Calculus for Asynchronous Side-Effecting Processes (Q3088290) (← links)
• Implementing Cantor’s Paradise (Q3179294) (← links)
• Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
• Trace-Based Coinductive Operational Semantics for While (Q3183540) (← links)
• Galois Connections for Recursive Types (Q3297839) (← links)
• A Type of Partial Recursive Functions (Q3543653) (← links)
• (Q4499300) (← links)
• Quotienting the delay monad by weak bisimilarity (Q4559601) (← links)
• Denotational semantics of recursive types in synthetic guarded domain theory (Q4623133) (← links)
• (Q4790656) (← links)
• (Q4968384) (← links)
• Soundness Conditions for Big-Step Semantics (Q5041092) (← links)
• The Scott model of PCF in univalent type theory (Q5055497) (← links)
• Partiality and Container Monads (Q5056003) (← links)
• (Q5091145) (← links)
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot (Q5875354) (← links)
• Logical Approaches to Computational Barriers (Q5898846) (← links)
• A model of PCF in guarded type theory (Q5971407) (← links)
• Formal definitions and proofs for partial (co)recursive functions (Q6615564) (← links)
• Greatest HITs: higher inductive types in coinductive definitions via induction under clocks (Q6649477) (← links)
• Two guarded recursive powerdomains for applicative simulation (Q6653758) (← links)
• Inductive and coinductive predicate liftings for effectful programs (Q6653761) (← links)