The following pages link to Dariusz Biernacki (Q283737):
Displayed 24 items.
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus (Q283739) (← links)
- On the dynamic extent of delimited continuations (Q1044694) (← links)
- An abstract machine for strong call by value (Q2038078) (← links)
- Proving soundness of extensional normal-form bisimilarities (Q2130582) (← links)
- Diacritical companions (Q2133161) (← links)
- A complete normal-form bisimilarity for state (Q2289066) (← links)
- On the static and dynamic extents of delimited continuations (Q2495550) (← links)
- A Context-based Approach to Proving Termination of Evaluation (Q2805157) (← links)
- Applicative Bisimulations for Delimited-Control Operators (Q2892764) (← links)
- Normal Form Bisimulations for Delimited-Control Operators (Q2900257) (← links)
- Environmental Bisimulations for Delimited-Control Operators (Q2937796) (← links)
- (Q4603450) (← links)
- (Q4957787) (← links)
- (Q5144665) (← links)
- Subtyping delimited continuations (Q5176965) (← links)
- (Q5277834) (← links)
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy (Q5310642) (← links)
- (Q5367066) (← links)
- (Q5369474) (← links)
- (Q5376646) (← links)
- (Q5377471) (← links)
- THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control (Q5472306) (← links)
- Logic Based Program Synthesis and Transformation (Q5713938) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)