Pages that link to "Item:Q2753682"
From MaRDI portal
The following pages link to Interactive programs in dependent type theory (Q2753682):
Displaying 20 items.
- Continuity of Gödel's system T definable functionals via effectful forcing (Q265800) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- The coinductive resumption monad (Q283770) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory (Q2503336) (← links)
- Programming interfaces and basic topology (Q2575770) (← links)
- From Proposition to Program (Q2798255) (← links)
- Dependent Types and Fibred Computational Effects (Q2811331) (← links)
- State dependent IO-monads in type theory (Q2849882) (← links)
- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) (Q2888481) (← links)
- Dependently Typed Programming Based on Automated Theorem Proving (Q2908568) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- Data Types with Symmetries and Polynomial Functors over Groupoids (Q3178294) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- Coalgebras as Types Determined by Their Elimination Rules (Q5253935) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- Idris, a general-purpose dependently typed programming language: Design and implementation (Q5398331) (← links)
- (Q5718566) (← links)
