Sandra Dylus

According to our database, Sandra Dylus authored at least 8 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2020

Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning.

Sandra Dylus

PhD thesis, 2020

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism.

Sandra Dylus, Jan Christiansen, Finn Teegen

Theory Pract. Log. Program., 2020

Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning.

Sandra Dylus

CoRR, 2020

2019

One Monad to Prove Them All.

Sandra Dylus, Jan Christiansen, Finn Teegen

Art Sci. Eng. Program., 2019

Verifying effectful Haskell programs in Coq.

Jan Christiansen, Sandra Dylus, Niels Bunkenburg

Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019

2018

One Monad to Prove Them All (Functional Pearl).

Jan Christiansen, Sandra Dylus, Finn Teegen

CoRR, 2018

Probabilistic Functional Logic Programming.

Sandra Dylus, Jan Christiansen, Finn Teegen

Proceedings of the Practical Aspects of Declarative Languages, 2018

2016

All sorts of permutations (functional pearl).

Jan Christiansen, Nikita Danilenko, Sandra Dylus

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016