Jan Christiansen

According to our database, Jan Christiansen authored at least 19 papers between 2004 and 2023.

Collaborative distances:

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

2023

Embedding Functional Logic Programming in Haskell via a Compiler Plugin.

Kai-Oliver Prott, Finn Teegen, Jan Christiansen

Proceedings of the Practical Aspects of Declarative Languages, 2023

2020

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

Sandra Dylus, Jan Christiansen, Finn Teegen

Theory Pract. Log. Program., 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

2013

A semantics for weakly encapsulated search in functional logic programs.

Jan Christiansen, Michael Hanus, Fabian Reck, Daniel Seidel

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2011

Investigating minimally strict functions in functional programming.

Jan Christiansen

PhD thesis, 2011

Minimally strict polymorphic functions.

Jan Christiansen, Daniel Seidel

Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Sloth - A Tool for Checking Minimal-Strictness.

Jan Christiansen

Proceedings of the Practical Aspects of Declarative Languages, 2011

2010

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry.

Jan Christiansen, Daniel Seidel, Janis Voigtländer

Proceedings of the Functional and Constraint Logic Programming, 2010

Free theorems for functional logic programs.

Jan Christiansen, Daniel Seidel, Janis Voigtländer

Proceedings of the 4th ACM Workshop Programming Languages meets Program Verification, 2010

2009

Free theorems for functional logic programs: (abstract only).

Jan Christiansen, Daniel Seidel, Janis Voigtländer

ACM SIGPLAN Notices, 2009

2008

EasyCheck - Test Data for Free.

Jan Christiansen, Sebastian Fischer

Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

A Relation Algebraic Semantics for a Lazy Functional Logic Language.

Bernd Braßel, Jan Christiansen

Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2007

Denotation by Transformation.

Bernd Braßel, Jan Christiansen

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

2006

A purely functional implementation of ROBDDs in Haskell.

Jan Christiansen, Frank Huch

Proceedings of the Revised Selected Papers from the Seventh Symposium on Trends in Functional Programming, 2006

2004

Searching for deadlocks while debugging concurrent haskell programs.

Jan Christiansen, Frank Huch

Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004