Pages that link to "Item:Q1199538"
From MaRDI portal
The following pages link to The revised report on the syntactic theories of sequential control and state (Q1199538):
Displaying 46 items.
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus (Q283739) (← links)
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- An imperative pure calculus (Q737089) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← links)
- Inferring the equivalence of functional programs that mutate data (Q1196301) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- A first order logic of effects (Q1390955) (← links)
- What is the natural abstraction level of an algorithm? (Q2117593) (← links)
- A lazy desugaring system for evaluating programs with sugars (Q2163178) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- A proof-theoretic foundation of abortive continuations (Q2464725) (← links)
- Investigations on the dual calculus (Q2503329) (← links)
- A Context-based Approach to Proving Termination of Evaluation (Q2805157) (← links)
- (Q2851057) (← links)
- Abstraction and Model Checking of Core Erlang Programs in Maude (Q2873779) (← links)
- Delimited control and computational effects (Q2875223) (← links)
- From Rewriting Logic, to Programming Language Semantics, to Program Verification (Q2945730) (← links)
- The impact of higher-order state and control effects on local relational reasoning (Q3165524) (← links)
- A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc (Q3179291) (← links)
- A Rewriting Logic Approach to Type Inference (Q3184729) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- Algebra Unifies Operational Calculi (Q3455645) (← links)
- Assignment Calculus: A Pure Imperative Language (Q3455835) (← links)
- Control reduction theories: the benefit of structural substitution (Q3503192) (← links)
- Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction (Q3520166) (← links)
- Safety of Nöcker's strictness analysis (Q3520168) (← links)
- (Q4222932) (← links)
- (Q4222943) (← links)
- Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
- Syntactic Type Soundness for the Region Calculus (Q4921505) (← links)
- (Q5094146) (← links)
- (Q5141619) (← links)
- (Q5155670) (← links)
- Concurrent Objects à la Carte (Q5187829) (← links)
- Control effects as a modality (Q5302644) (← links)
- (Q5376659) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- Operational interpretations of an extension of F<sub>ω</sub> with control operators (Q5687907) (← links)
- Capsules and Closures (Q5739358) (← links)
- A categorical interpretation of Landin's correspondence principle (Q5890068) (← links)
- On the semantics of classical disjunction (Q5939825) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- Adding Negation to Lambda Mu (Q6135761) (← links)
