default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Marlow
Person information
- affiliation: Facebook UK Ltd., London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Andrey Mokhov, Georgy Lukyanov, Simon Marlow, Jerémie Dimino:
Selective applicative functors. Proc. ACM Program. Lang. 3(ICFP): 90:1-90:29 (2019)- 2016
- [j5]K. C. Sivaramakrishnan, Tim Harris, Simon Marlow, Simon Peyton Jones:
Composable scheduler activations for Haskell. J. Funct. Program. 26: e9 (2016) - [c37]Simon Marlow, Simon Peyton Jones, Edward Kmett, Andrey Mokhov:
Desugaring Haskell's do-notation into applicative operations. Haskell 2016: 92-104 - [c36]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones, Simon Marlow:
Non-recursive make considered harmful: build systems at scale. Haskell 2016: 170-181 - 2014
- [c35]Simon Marlow, Louis Brandy, Jonathan Coens, Jon Purdy:
There is no fork: an abstraction for efficient, concurrent, and concise data access. ICFP 2014: 325-337 - [c34]Scott Kilpatrick, Derek Dreyer, Simon L. Peyton Jones, Simon Marlow:
Backpack: retrofitting Haskell with interfaces. POPL 2014: 19-32 - 2012
- [c33]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe haskell. Haskell 2012: 137-148 - [i1]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe Haskell. Adv. Math. Commun. 1 (2012) - 2011
- [c32]Simon Marlow:
Parallel and Concurrent Programming in Haskell. CEFP 2011: 339-401 - [c31]Simon Marlow, Ryan Newton, Simon L. Peyton Jones:
A monad for deterministic parallelism. Haskell 2011: 71-82 - [c30]Simon Marlow, Simon L. Peyton Jones:
Multicore garbage collection with local heaps. ISMM 2011: 21-32 - 2010
- [c29]Simon Marlow, Patrick Maier, Hans-Wolfgang Loidl, Mustafa Aswad, Philip W. Trinder:
Seq no more: better strategies for parallel Haskell. Haskell 2010: 91-102
2000 – 2009
- 2009
- [c28]Don Jones Jr., Simon Marlow, Satnam Singh:
Parallel performance tuning for Haskell. Haskell 2009: 81-92 - [c27]Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Runtime support for multicore Haskell. ICFP 2009: 65-78 - [c26]Jost Berthold, Simon Marlow, Kevin Hammond
, Abdallah Al Zain:
Comparing and Optimising Parallel Haskell Implementations for Multicore Machines. ICPP Workshops 2009: 386-393 - [c25]Martin Sulzmann, Edmund S. L. Lam, Simon Marlow:
Comparing the performance of concurrent linked-list implementations in Haskell. DAMP 2009: 37-46 - 2008
- [j4]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. Commun. ACM 51(8): 91-100 (2008) - [c24]Simon Marlow, Tim Harris, Roshan P. James, Simon L. Peyton Jones:
Parallel generational-copying garbage collection with a block-structured heap. ISMM 2008: 11-20 - 2007
- [c23]Simon Marlow, José Iborra, Bernard J. Pope, Andy Gill:
A lightweight interactive debugger for haskell. Haskell 2007: 13-24 - [c22]Peng Li, Simon Marlow, Simon L. Peyton Jones, Andrew P. Tolmach:
Lightweight concurrency primitives for GHC. Haskell 2007: 107-118 - [c21]Simon Marlow, Alexey Rodriguez Yakushev, Simon L. Peyton Jones:
Faster laziness using dynamic pointer tagging. ICFP 2007: 277-288 - [c20]Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Gabriele Keller, Simon Marlow:
Data parallel Haskell: a status report. DAMP 2007: 10-18 - 2006
- [j3]Simon Marlow, Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages. J. Funct. Program. 16(4-5): 415-449 (2006) - [c19]Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Lock Free Data Structures Using STM in Haskell. FLOPS 2006: 65-80 - [c18]Simon Marlow:
An extensible dynamically-typed hierarchy of exceptions. Haskell 2006: 96-106 - 2005
- [c17]Krasimir Angelov, Simon Marlow:
Visual haskell: a full-featured haskell development environment. Haskell 2005: 5-16 - [c16]Tim Harris, Simon Marlow, Simon L. Peyton Jones:
Haskell on a shared-memory multiprocessor. Haskell 2005: 49-61 - [c15]Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow:
Associated types with class. POPL 2005: 1-13 - [c14]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. PPoPP 2005: 48-60 - 2004
- [c13]Simon Marlow, Simon L. Peyton Jones, Wolfgang Thaller:
Extending the Haskell foreign function interface with concurrency. Haskell 2004: 22-32 - [c12]Simon Marlow, Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages. ICFP 2004: 4-15 - [c11]Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, Ronald Lyndon While:
Exploring the barrier to entry: incremental generational garbage collection for Haskell. ISMM 2004: 163-174 - 2002
- [j2]Simon Marlow:
Developing a high-performance web server in Concurrent Haskell. J. Funct. Program. 12(4&5): 359-374 (2002) - [j1]Simon L. Peyton Jones, Simon Marlow:
Secrets of the Glasgow Haskell Compiler inliner. J. Funct. Program. 12(4&5): 393-433 (2002) - [c10]Simon Marlow:
Haddock, a Haskell documentation tool. Haskell 2002: 78-89 - 2001
- [c9]Simon Marlow, Simon L. Peyton Jones, Andrew Moran, John H. Reppy:
Asynchronous Exceptions in Haskell. PLDI 2001: 274-285 - 2000
- [c8]Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, Ronald Lyndon While:
Non-stop Haskell. ICFP 2000: 257-267 - [c7]Simon Marlow:
Developing High-Performance Server Applications in Haskell - Case Study: A Haskell Web Server. Haskell 2000: 75-90
1990 – 1999
- 1999
- [c6]Simon L. Peyton Jones, Simon Marlow, Conal Elliott:
Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell. IFL 1999: 37-58 - [c5]Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow:
A Semantics for Imprecise Exceptions. PLDI 1999: 25-36 - 1997
- [c4]Simon Marlow, Philip Wadler:
A Practical Subtyping System For Erlang. ICFP 1997: 136-149 - 1995
- [b1]Simon David Marlow:
Deforestation for higher-order functional programs. University of Glasgow, UK, 1995 - 1993
- [c3]Simon Marlow:
Update Avoidance Analysis by Abstract Interpretation. Functional Programming 1993: 170-184 - 1992
- [c2]John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler:
Avoiding Unnecessary Updates. Functional Programming 1992: 144-153 - [c1]Simon Marlow, Philip Wadler:
Deforestation for Higher-Order Functions. Functional Programming 1992: 154-165
Coauthor Index
aka: Simon Peyton Jones
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 2025-01-20 23:00 CET 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:
