 | 2009 |
|---|
| 8 |       | Malgorzata Biernacka,
Dariusz Biernacki:
Context-based proofs of termination for typed delimited-control operators.
PPDP 2009: 289-300 |
| 7 | | Malgorzata Biernacka,
Olivier Danvy:
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines.
Semantics and Algebraic Specification 2009: 186-206 |
| 6 | | Malgorzata Biernacka,
Dariusz Biernacki:
A Context-based Approach to Proving Termination of Evaluation.
Electr. Notes Theor. Comput. Sci. 249: 169-192 (2009) |
| 2007 |
|---|
| 5 | | Malgorzata Biernacka,
Olivier Danvy:
A concrete framework for environment machines.
ACM Trans. Comput. Log. 9(1): (2007) |
| 4 | | Malgorzata Biernacka,
Olivier Danvy:
A syntactic correspondence between context-sensitive calculi and abstract machines.
Theor. Comput. Sci. 375(1-3): 76-108 (2007) |
| 2006 |
|---|
| 3 | | Malgorzata Biernacka,
Olivier Danvy,
Kristian Støvring:
Program Extraction From Proofs of Weak Head Normalization.
Electr. Notes Theor. Comput. Sci. 155: 169-189 (2006) |
| 2005 |
|---|
| 2 | | Malgorzata Biernacka,
Dariusz Biernacki,
Olivier Danvy:
An Operational Foundation for Delimited Continuations in<br><br> the<br><br><br> CPS<br><br> Hierarchy
CoRR abs/cs/0508048: (2005) |
| 1 | | Malgorzata Biernacka,
Dariusz Biernacki,
Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Logical Methods in Computer Science 1(2): (2005) |
