Pages that link to "Item:Q5210768"
From MaRDI portal
The following pages link to A fixedpoint approach to implementing (Co)inductive definitions (Q5210768):
Displaying 14 items.
- Program development schemata as derived rules (Q1583853) (← links)
- Structuring metatheory on inductive definitions (Q1854368) (← links)
- On the structural properties of the set of fixpoints for nondeterministic recursive definitions (Q1915506) (← links)
- A general mathematics of names (Q2373874) (← links)
- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions (Q2798773) (← links)
- On Tarski’s fixed point theorem (Q2944797) (← links)
- Friends with Benefits (Q2988636) (← links)
- ABSTRACT INDUCTIVE AND CO-INDUCTIVE DEFINITIONS (Q4579809) (← links)
- An embedding of Ruby in Isabelle (Q4647513) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Using a generalisation critic to find bisimulations for coinductive proofs (Q5234712) (← links)
- Coalgebras as Types Determined by Their Elimination Rules (Q5253935) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)
- A concrete final coalgebra theorem for ZF set theory (Q6061877) (← links)