Pages that link to "Item:Q1075045"
From MaRDI portal
The following pages link to A simple fixpoint argument without the restriction to continuity (Q1075045):
Displaying 14 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Interpretations of recursion under unbounded nondeterminacy (Q1115173) (← links)
- Repetitions, known or unknown? (Q1183432) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- Relational semantics revisited (Q2810687) (← links)
- Continuity in Semantic Theories of Programming (Q2963952) (← links)
- A simple fix-point argument without the restriction to continuity (Q3719822) (← links)
- (Q5346635) (← links)
- A category-theoretic semantics for unbounded indeterminacy (Q5887523) (← links)