default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Christiansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Kai-Oliver Prott
, Finn Teegen, Jan Christiansen:
Embedding Functional Logic Programming in Haskell via a Compiler Plugin. PADL 2023: 37-55- 2020
- [j3]Sandra Dylus, Jan Christiansen, Finn Teegen:
Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism. Theory Pract. Log. Program. 20(1): 147-175 (2020)
2010 – 2019
- 2019
- [j2]Sandra Dylus, Jan Christiansen, Finn Teegen:
One Monad to Prove Them All. Art Sci. Eng. Program. 3(3): 8 (2019) - [c13]Jan Christiansen, Sandra Dylus, Niels Bunkenburg:
Verifying effectful Haskell programs in Coq. Haskell@ICFP 2019: 125-138 - [i2]Sandra Dylus, Jan Christiansen, Finn Teegen:
Implementing a Library for Probabilistic Programming using Non-strict Non-determinism. CoRR abs/1905.07212 (2019) - 2018
- [c12]Sandra Dylus, Jan Christiansen, Finn Teegen:
Probabilistic Functional Logic Programming. PADL 2018: 3-19 - [i1]Jan Christiansen, Sandra Dylus, Finn Teegen:
One Monad to Prove Them All (Functional Pearl). CoRR abs/1805.08059 (2018) - 2016
- [c11]Jan Christiansen, Nikita Danilenko, Sandra Dylus:
All sorts of permutations (functional pearl). ICFP 2016: 168-179 - 2013
- [c10]Jan Christiansen, Michael Hanus, Fabian Reck, Daniel Seidel:
A semantics for weakly encapsulated search in functional logic programs. PPDP 2013: 49-60 - 2011
- [b1]Jan Christiansen:
Investigating minimally strict functions in functional programming. University of Kiel, 2011, pp. 1-199 - [c9]Jan Christiansen:
Sloth - A Tool for Checking Minimal-Strictness. PADL 2011: 160-174 - [c8]Jan Christiansen, Daniel Seidel:
Minimally strict polymorphic functions. PPDP 2011: 53-64 - 2010
- [c7]Jan Christiansen, Daniel Seidel, Janis Voigtländer:
Free theorems for functional logic programs. PLPV 2010: 39-48 - [c6]Jan Christiansen, Daniel Seidel, Janis Voigtländer:
An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry. WFLP 2010: 119-136
2000 – 2009
- 2009
- [j1]Jan Christiansen, Daniel Seidel, Janis Voigtländer:
Free theorems for functional logic programs: (abstract only). ACM SIGPLAN Notices 44(11): 7 (2009) - 2008
- [c5]Bernd Braßel, Jan Christiansen:
A Relation Algebraic Semantics for a Lazy Functional Logic Language. RelMiCS 2008: 37-53 - [c4]Jan Christiansen, Sebastian Fischer:
EasyCheck - Test Data for Free. FLOPS 2008: 322-336 - 2007
- [c3]Bernd Braßel, Jan Christiansen:
Denotation by Transformation. LOPSTR 2007: 90-105 - 2006
- [c2]Jan Christiansen, Frank Huch:
A purely functional implementation of ROBDDs in Haskell. Trends in Functional Programming 2006: 55-71 - 2004
- [c1]Jan Christiansen, Frank Huch:
Searching for deadlocks while debugging concurrent haskell programs. ICFP 2004: 28-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
