Maciej Piróg

Orcid: 0000-0002-5889-3388

According to our database1, Maciej Piróg authored at least 21 papers between 2010 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
High-level effect handlers in C++.
Proc. ACM Program. Lang., 2022

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

Degrading Lists.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

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

Guarded and Unguarded Iteration for Generalized Processes.
Log. Methods Comput. Sci., 2019

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

Monad transformers and modular algebraic effects: what binds them together.
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 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

Syntax and Semantics for Operations with Scopes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Backtracking with cut via a distributive law and left-zero monoids.
J. Funct. Program., 2017

Unifying Guarded and Unguarded Iteration.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
Tabling with Sound Answer Subsumption.
Theory Pract. Log. Program., 2016

Eilenberg-Moore Monoids and Backtracking Monad Transformers.
Proceedings of the Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016

String diagrams for free monads (functional pearl).
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015
From Push/Enter to Eval/Apply by Program Transformation.
Proceedings of the Workshop on Continuations, 2015

Modules Over Monads and Their Algebras.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
The Coinductive Resumption Monad.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013
Monads for Behaviour.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

2012
Tracing monadic computations and representing effects
Proceedings of the Proceedings Fourth Workshop on Mathematically Structured Functional Programming, 2012

2010
A systematic derivation of the STG machine verified in Coq.
Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, 2010


  Loading...