Pages that link to "Item:Q1101435"
From MaRDI portal
The following pages link to A syntactic theory of sequential control (Q1101435):
Displayed 15 items.
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- The revised report on the syntactic theories of sequential control and state (Q1199538) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- A syntactic theory of sequential state (Q1263961) (← links)
- A constructive logic behind the catch and throw mechanism (Q1337695) (← links)
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- Programs from proofs using classical dependent choice (Q2482844) (← links)
- Completeness of continuation models for \(\lambda_\mu\)-calculus (Q2506496) (← links)
- Universe Types for Topology and Encapsulation (Q3602996) (← links)
- Representing Control: a Study of the CPS Transformation (Q4279251) (← links)
- Representing Control: a Study of the CPS Transformation (Q4493071) (← links)
- Sound and complete axiomatisations of call-by-value control operators (Q4882487) (← links)
- A monadic framework for delimited continuations (Q5428371) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)