Malgorzata Biernacka

Orcid: 0000-0001-8094-0980

According to our database1, Malgorzata Biernacka authored at least 20 papers between 2005 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A simple and efficient implementation of strong call by need by an abstract machine.
Proc. ACM Program. Lang., 2022

The Zoo of Lambda-Calculus Reduction Strategies, And Coq.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

Non-Deterministic Abstract Machines.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
Strong Call by Value is Reasonable for Time.
CoRR, 2021

A Derived Reasonable Abstract Machine for Strong Call by Value.
Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

2020
An Abstract Machine for Strong Call by Value.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019
Deriving an Abstract Machine for Strong Call by Need.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2017
Generalized Refocusing: From Hybrid Strategies to Abstract Machines.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Fully abstract encodings of λ-calculus in HOcore through abstract machines.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2013
Proving termination of evaluation for System F with control operators.
Proceedings of the Proceedings First Workshop on Control Operators and their Semantics, 2013

An operational foundation for the tactic language of Coq.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2011
Typing control operators in the CPS hierarchy.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

2010
Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq.
Proceedings of the Implementation and Application of Functional Languages, 2010

2009
A Context-based Approach to Proving Termination of Evaluation.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Context-based proofs of termination for typed delimited-control operators.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines.
Proceedings of the Semantics and Algebraic Specification, 2009

2007
A concrete framework for environment machines.
ACM Trans. Comput. Log., 2007

A syntactic correspondence between context-sensitive calculi and abstract machines.
Theor. Comput. Sci., 2007

2005
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Log. Methods Comput. Sci., 2005

Program Extraction From Proofs of Weak Head Normalization.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005


  Loading...