Filip Sieczkowski

Orcid: 0000-0001-5011-3458

Affiliations:
  • Heriot-Watt University, UK


According to our database1, Filip Sieczkowski authored at least 20 papers between 2010 and 2024.

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

2024
The Essence of Generalized Algebraic Data Types.
Proc. ACM Program. Lang., January, 2024

2023
A General Fine-Grained Reduction Theory for Effect Handlers.
Proc. ACM Program. Lang., August, 2023

2021
Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory.
Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

2020
Binders by day, labels by night: effect instances via lexically scoped handlers.
Proc. ACM Program. Lang., 2020

A Reflection on Continuation-Composing Style.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
Abstracting algebraic effects.
Proc. ACM Program. Lang., 2019

Typed Equivalence of Effect Handlers and Delimited Control.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Equational Theories and Monads from Polynomial Cayley Representations.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Handle with care: relational interpretation of algebraic effects and handlers.
Proc. ACM Program. Lang., 2018

Heartbeat scheduling: provable efficiency for nested parallelism.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

2016
A Kripke logical relation for effect-based program transformations.
Inf. Comput., 2016

Dag-calculus: a calculus for parallel computation.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Transfinite Step-Indexing: Decoupling Concrete and Logical Steps.
Proceedings of the Programming Languages and Systems, 2016

2015
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

A Separation Logic for Fictional Sequential Consistency.
Proceedings of the Programming Languages and Systems, 2015

2012
Formalized Verification of Snapshotable Trees: Separation and Sharing.
Proceedings of the Verified Software: Theories, Tools, Experiments, 2012

A Concurrent Logical Relation.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coq.
Proceedings of the Interactive Theorem Proving - Second International Conference, 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


  Loading...