Pages that link to "Item:Q5657655"
From MaRDI portal
The following pages link to Fixpoint approach to the theory of computation (Q5657655):
Displayed 17 items.
- A survey of state vectors (Q458456) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- The congruence of two programming language definitions (Q1155952) (← links)
- On the fixpoints of monogenic functions in free monoids (Q1215012) (← links)
- Least fixed points revisited (Q1234588) (← links)
- On the completeness of the inductive assertion method (Q1236426) (← links)
- Fixed-point constructions in order-enriched categories (Q1255084) (← links)
- Program development schemata as derived rules (Q1583853) (← links)
- Caratterizzazione dei reticoli continui per la teoria della computazione di Dana Scott (Q1845229) (← links)
- Algebraic correctness proofs for compiling recursive function definitions with strictness information (Q2502270) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- (Q4146238) (← links)
- (Q4157924) (← links)
- (Q4558787) (← links)
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) (← links)