Pages that link to "Item:Q1101435"
From MaRDI portal
The following pages link to A syntactic theory of sequential control (Q1101435):
Displaying 35 items.
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Musings around the geometry of interaction, and coherence (Q534708) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← 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)
- From global to local state, coalgebraically and compositionally (Q2133173) (← 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)
- A Context-based Approach to Proving Termination of Evaluation (Q2805157) (← links)
- A Third-Order Representation of the λμ-Calculus (Q2841236) (← links)
- Model Checking Erlang Programs – Abstracting Recursive Function Calls (Q2841292) (← links)
- Delimited control and computational effects (Q2875223) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc (Q3179291) (← links)
- Towards Erlang Verification by Term Rewriting (Q3453650) (← 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)
- (Q4957790) (← links)
- Programming and Proving with Classical Types (Q5055999) (← links)
- Decomposing typed lambda calculus into a couple of categorical programming languages (Q5057475) (← links)
- (Q5079752) (← links)
- Programs with continuations and linear logic (Q5096236) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
- On the unification of classical, intuitionistic and affine logics (Q5236553) (← links)
- (Q5376659) (← links)
- A monadic framework for delimited continuations (Q5428371) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)