Direkt zum Inhalt

Publikationen

2020

2019

  • One Monad to Prove Them All

    Dylus, S., Christiansen, J., & Teegen, F. (2019). One Monad to Prove Them All. The Art, Science, And Engineering Of Programming, 3. http://doi.org/10.22152/programming-journal.org/2019/3/8

    Abstract

    Weiterführende Links

    Filter Tags

  • Verifying Effectful Haskell Programs in Coq

    Christiansen, J., Dylus, S., & Bunkenburg, N. (2019). Verifying Effectful Haskell Programs in Coq. In Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell - Haskell 2019 (S. 125-138). ACM Press. http://doi.org/10.1145/3331545.3342592

    Abstract

    Weiterführende Links

    Filter Tags

2018

2016

2013

  • A Semantics for Weakly Encapsulated Search in Functional Logic Programs

    Christiansen, J., Hanus, M., Reck, F., & Seidel, D. (2013). A Semantics for Weakly Encapsulated Search in Functional Logic Programs. In Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP 13 (S. 49-60). ACM Press. http://doi.org/10.1145/2505879.2505896

    Abstract

    Weiterführende Links

    Filter Tags

2011

  • Sloth – a Tool for Checking Minimal-Strictness

    Christiansen, J. (2011). Sloth – a Tool for Checking Minimal-Strictness. In R. Rocha & Launchbury, J. (Hrsg.), Practical Aspects of Declarative Languages (S. 160-174). Springer Berlin Heidelberg.

    Abstract

    Weiterführende Links

    Filter Tags

  • Minimally Strict Polymorphic Functions

    Christiansen, J., & Seidel, D. (2011). Minimally Strict Polymorphic Functions. In Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming - PPDP 11 (S. 53). ACM Press. http://doi.org/10.1145/2003476.2003487

    Abstract

    Weiterführende Links

    Filter Tags

2010