Остановите войну!
for scientists:
default search action
Daan Leijen
- > Home > Persons > Daan Leijen
Publications
- 2023
- [j7]Anton Lorenzen, Daan Leijen, Wouter Swierstra:
FP²: Fully in-Place Functional Programming. Proc. ACM Program. Lang. 7(ICFP): 275-304 (2023) - [j6]Luna Phipps-Costin, Andreas Rossberg, Arjun Guha, Daan Leijen, Daniel Hillerström, K. C. Sivaramakrishnan, Matija Pretnar, Sam Lindley:
Continuing WebAssembly with Effect Handlers. Proc. ACM Program. Lang. 7(OOPSLA2): 460-485 (2023) - [j5]Daan Leijen, Anton Lorenzen:
Tail Recursion Modulo Context: An Equational Approach. Proc. ACM Program. Lang. 7(POPL): 1152-1181 (2023) - [i2]Luna Phipps-Costin, Andreas Rossberg, Arjun Guha, Daan Leijen, Daniel Hillerström, K. C. Sivaramakrishnan, Matija Pretnar, Sam Lindley:
Continuing WebAssembly with Effect Handlers. CoRR abs/2308.08347 (2023) - 2022
- [j4]Anton Lorenzen, Daan Leijen:
Reference counting with frame limited reuse. Proc. ACM Program. Lang. 6(ICFP): 357-380 (2022) - [j3]Ningning Xie, Youyou Cong, Kazuki Ikemori, Daan Leijen:
First-class names for effect handlers. Proc. ACM Program. Lang. 6(OOPSLA2): 30-59 (2022) - [c40]Kazuki Ikemori, Youyou Cong, Hidehiko Masuhara, Daan Leijen:
Sound and Complete Type Inference for Closed Effect Rows. TFP 2022: 144-168 - [c39]Naoya Furudono, Youyou Cong, Hidehiko Masuhara, Daan Leijen:
Towards Efficient Adjustment of Effect Rows. TFP 2022: 169-191 - 2021
- [j2]Ningning Xie, Daan Leijen:
Generalized evidence passing for effect handlers: efficient compilation of effect handlers to C. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - [c38]Alex Reinking, Ningning Xie, Leonardo de Moura, Daan Leijen:
Perceus: garbage free reference counting with reuse. PLDI 2021: 96-111 - 2020
- [j1]Ningning Xie, Jonathan Immanuel Brachthäuser, Daniel Hillerström, Philipp Schuster, Daan Leijen:
Effect handlers, evidently. Proc. ACM Program. Lang. 4(ICFP): 99:1-99:29 (2020) - [c37]Ningning Xie, Daan Leijen:
Effect handlers in Haskell, evidently. Haskell@ICFP 2020: 95-108 - 2019
- [c36]Daan Leijen, Benjamin Zorn, Leonardo de Moura:
Mimalloc: Free List Sharding in Action. APLAS 2019: 244-265 - 2018
- [i1]Sivaramakrishnan Krishnamoorthy Chandrasekaran, Daan Leijen, Matija Pretnar, Tom Schrijvers:
Algebraic Effect Handlers go Mainstream (Dagstuhl Seminar 18172). Dagstuhl Reports 8(4): 104-125 (2018) - 2017
- [c33]Matthew C. Loring, Mark Marron, Daan Leijen:
Semantics of asynchronous JavaScript. DLS 2017: 51-62 - 2016
- [c28]Niki Vazou, Daan Leijen:
From Monads to Effects and Back. PADL 2016: 169-186 - 2015
- [c26]Sebastian Burckhardt, Daan Leijen, Jonathan Protzenko, Manuel Fähndrich:
Global Sequence Protocol: A Robust Abstraction for Replicated Shared State. ECOOP 2015: 568-590 - 2014
- [c25]Michael Hicks, Gavin M. Bierman, Nataliya Guts, Daan Leijen, Nikhil Swamy:
Polymonadic Programming. MSFP 2014: 79-99 - 2013
- [c23]Thomas Ball, Peli de Halleux, Nikhil Swamy, Daan Leijen:
Increasing human-tool interaction via the web. PASTE 2013: 49-52 - 2012
- [c22]Sebastian Burckhardt, Manuel Fähndrich, Daan Leijen, Benjamin P. Wood:
Cloud Types for Eventual Consistency. ECOOP 2012: 283-307 - [c21]Sebastian Burckhardt, Daan Leijen, Manuel Fähndrich, Mooly Sagiv:
Eventually Consistent Transactions. ESOP 2012: 67-86 - [c20]Manuel Fähndrich, Michael Barnett, Daan Leijen, Francesco Logozzo:
Integrating a set of contract checking tools into visual studio. TOPI@ICSE 2012: 43-48 - 2011
- [c19]Sebastian Burckhardt, Daan Leijen:
Semantics of Concurrent Revisions. ESOP 2011: 116-135 - [c18]Daan Leijen, Manuel Fähndrich, Sebastian Burckhardt:
Prettier concurrency: purely functional concurrent revisions. Haskell 2011: 83-94 - [c17]Nikhil Swamy, Nataliya Guts, Daan Leijen, Michael Hicks:
Lightweight monadic programming in ML. ICFP 2011: 15-27 - [c16]Sebastian Burckhardt, Daan Leijen, Caitlin Sadowski, Jaeheon Yi, Thomas Ball:
Two for the price of one: a model for parallel and incremental computation. OOPSLA 2011: 427-444 - 2010
- [c15]Sebastian Burckhardt, Alexandro Baldassin, Daan Leijen:
Concurrent programming with revisions and isolation types. OOPSLA 2010: 691-707 - 2009
- [c14]Daan Leijen, Wolfram Schulte, Sebastian Burckhardt:
The design of a task parallel library. OOPSLA 2009: 227-242 - 2005
- [c10]Daan Leijen, Andres Löh:
Qualified types for MLF. ICFP 2005: 144-155 - 2003
- [c7]Bastiaan Heeren, Daan Leijen, Arjan van IJzendoorn:
Helium, for learning Haskell. Haskell 2003: 62-71 - 1999
- [c6]Daan Leijen, Erik Meijer:
Domain specific embedded compilers. DSL 1999: 109-122 - [c5]Sigbjørn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones:
Calling Hell From Heaven and Heaven From Hell. ICFP 1999: 114-125 - [c4]Erik Meijer, Daan Leijen, James Hook:
Client-Side Web Scripting with HaskellScript. PADL 1999: 196-210 - 1998
- [c3]Daan Leijen, Erik Meijer, James Hook:
Haskell as an Automation Controller. Advanced Functional Programming 1998: 268-289 - [c2]Sigbjørn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones:
H/Direct: A Binary Foreign Language Interface for Haskell. ICFP 1998: 153-162 - [c1]Simon Peyton Jones, Erik Meijer, Daan Leijen:
Scripting COM components in Haskell. ICSR 1998: 224-233
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-04-25 02:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint