default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon L. Peyton Jones
Simon Peyton Jones
Person information
- affiliation: Microsoft Research
- award (2016): Programming Languages Achievement Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i15]Sebastian Graf
, Simon Peyton Jones, Sven Keidel:
Abstracting Denotational Interpreters. CoRR abs/2403.02778 (2024)- 2023
- [j75]Lennart Augustsson, Joachim Breitner, Koen Claessen, Ranjit Jhala, Simon Peyton Jones, Olin Shivers, Guy L. Steele Jr., Tim Sweeney:
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming. Proc. ACM Program. Lang. 7(ICFP): 417-447 (2023) - [i14]Simon Peyton Jones, Sebastian Graf:
Triemaps that match. CoRR abs/2302.08775 (2023) - 2022
- [j74]Faustyna Krawiec, Simon Peyton Jones, Neel Krishnaswami, Tom Ellis, Richard A. Eisenberg, Andrew W. Fitzgibbon:
Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - [c155]Jooyeon Kim, Angus Lamb, Simon Woodhead, Simon Peyton Jones, Cheng Zhang, Miltiadis Allamanis:
CoRGi: Content-Rich Graph Neural Networks with Attention. KDD 2022: 773-783 - [c154]Pablo Morales-Alvarez, Wenbo Gong, Angus Lamb, Simon Woodhead, Simon Peyton Jones, Nick Pawlowski, Miltiadis Allamanis, Cheng Zhang:
Simultaneous Missing Value Imputation and Structure Learning with Groups. NeurIPS 2022 - [i13]Amir Shaikhha, Mathieu Huot, Shabnam Ghasemirad, Andrew W. Fitzgibbon, Simon Peyton Jones, Dimitrios Vytiniotis:
Efficient and Sound Differentiable Programming in a Functional Array-Processing Language. CoRR abs/2212.10307 (2022) - 2021
- [c153]Zichao Wang, Sebastian Tschiatschek, Simon Woodhead, José Miguel Hernández-Lobato, Simon Peyton Jones, Richard G. Baraniuk, Cheng Zhang:
Educational Question Mining At Scale: Prediction, Analysis and Personalization. AAAI 2021: 15669-15677 - [c152]Krzysztof Maziarz, Tom Ellis, Alan Lawrence, Andrew W. Fitzgibbon, Simon Peyton Jones:
Hashing modulo alpha-equivalence. PLDI 2021: 960-973 - [i12]Zichao Wang, Angus Lamb, Evgeny Saveliev, Pashmina Cameron, Yordan Zaykov, José Miguel Hernández-Lobato, Richard E. Turner, Richard G. Baraniuk, Craig Barton, Simon Peyton Jones, Simon Woodhead, Cheng Zhang:
Results and Insights from Diagnostic Questions: The NeurIPS 2020 Education Challenge. CoRR abs/2104.04034 (2021) - [i11]Krzysztof Maziarz, Tom Ellis, Alan Lawrence, Andrew W. Fitzgibbon, Simon Peyton Jones:
Hashing Modulo Alpha-Equivalence. CoRR abs/2105.02856 (2021) - [i10]Jooyeon Kim, Angus Lamb, Simon Woodhead, Simon Peyton Jones, Cheng Zheng, Miltiadis Allamanis:
CoRGi: Content-Rich Graph Neural Networks with Attention. CoRR abs/2110.04866 (2021) - [i9]Pablo Morales-Alvarez, Angus Lamb, Simon Woodhead, Simon Peyton Jones, Miltiadis Allamanis, Cheng Zhang:
VICause: Simultaneous Missing Value Imputation and Causal Discovery with Groups. CoRR abs/2110.08223 (2021) - 2020
- [j73]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones:
Build systems à la carte: Theory and practice. J. Funct. Program. 30: e11 (2020) - [j72]Matt McCutchen, Judith Borghouts, Andrew D. Gordon, Simon Peyton Jones, Advait Sarkar:
Elastic sheet-defined functions: Generalising spreadsheet functions to variable-size input arrays. J. Funct. Program. 30: e26 (2020) - [j71]Alejandro Serrano, Jurriaan Hage, Simon Peyton Jones, Dimitrios Vytiniotis:
A quick look at impredicativity. Proc. ACM Program. Lang. 4(ICFP): 89:1-89:29 (2020) - [j70]Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg:
Kinds are calling conventions. Proc. ACM Program. Lang. 4(ICFP): 104:1-104:29 (2020) - [j69]Sebastian Graf, Simon Peyton Jones, Ryan G. Scott:
Lower your guards: a compositional pattern-match coverage checker. Proc. ACM Program. Lang. 4(ICFP): 107:1-107:30 (2020) - [c151]Zichao Wang, Angus Lamb, Evgeny Saveliev, Pashmina Cameron, Yordan Zaykov, José Miguel Hernández-Lobato, Richard E. Turner, Richard G. Baraniuk, Craig Barton, Simon Peyton Jones, Simon Woodhead, Cheng Zhang:
Results and Insights from Diagnostic Questions: The NeurIPS 2020 Education Challenge. NeurIPS (Competition and Demos) 2020: 191-205 - [i8]Zichao Wang, Sebastian Tschiatschek, Simon Woodhead, José Miguel Hernández-Lobato, Simon Peyton Jones, Cheng Zhang:
Large-Scale Educational Question Analysis with Partial Variational Auto-encoders. CoRR abs/2003.05980 (2020) - [i7]Zichao Wang, Angus Lamb, Evgeny Saveliev, Pashmina Cameron, Yordan Zaykov, José Miguel Hernández-Lobato, Richard E. Turner, Richard G. Baraniuk, Craig Barton, Simon Peyton Jones, Simon Woodhead, Cheng Zhang:
Diagnostic Questions: The NeurIPS 2020 Education Challenge. CoRR abs/2007.12061 (2020)
2010 – 2019
- 2019
- [j68]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones:
Efficient differentiable programming in a functional array-processing language. Proc. ACM Program. Lang. 3(ICFP): 97:1-97:30 (2019) - [j67]Csongor Kiss, Tony Field, Susan Eisenbach, Simon Peyton Jones:
Higher-order type-level programming in Haskell. Proc. ACM Program. Lang. 3(ICFP): 102:1-102:26 (2019) - [c150]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Codata in Action. ESOP 2019: 119-146 - [c149]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Making a faster Curry with extensional types. Haskell@ICFP 2019: 58-70 - [i6]Sebastian Graf, Simon Peyton Jones:
Selective Lambda Lifting. CoRR abs/1910.11717 (2019) - 2018
- [j66]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones:
Build systems à la carte. Proc. ACM Program. Lang. 2(ICFP): 79:1-79:29 (2018) - [j65]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. Proc. ACM Program. Lang. 2(POPL): 5:1-5:29 (2018) - [c148]Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones:
Type variables in patterns. Haskell@ICFP 2018: 94-105 - [c147]Alejandro Serrano, Jurriaan Hage, Dimitrios Vytiniotis, Simon Peyton Jones:
Guarded impredicative polymorphism. PLDI 2018: 783-796 - [c146]Advait Sarkar, Andrew D. Gordon, Simon Peyton Jones, Neil Toronto:
Calculation View: multiple-representation editing in spreadsheets. VL/HCC 2018: 85-93 - [i5]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones, Christoph Koch:
Efficient Differentiable Programming in a Functional Array-Processing Language. CoRR abs/1806.02136 (2018) - [i4]Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones:
Type variables in patterns. CoRR abs/1806.03476 (2018) - 2017
- [j64]Geoffrey Mainland, Roman Leshchinskiy, Simon Peyton Jones:
Exploiting vector instructions with generalized stream fusion. Commun. ACM 60(5): 83-91 (2017) - [j63]Ilya Sergey, Dimitrios Vytiniotis, Simon L. Peyton Jones, Joachim Breitner:
Modular, higher order cardinality analysis in theory and practice. J. Funct. Program. 27: e11 (2017) - [j62]Shayan Najd, Simon Peyton Jones:
Trees that Grow. J. Univers. Comput. Sci. 23(1): 42-62 (2017) - [j61]Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones:
SHErrLoc: A Static Holistic Error Locator. ACM Trans. Program. Lang. Syst. 39(4): 18:1-18:47 (2017) - [c145]Simon Peyton Jones:
How to Write a Great Research Paper. ICCSW 2017: 1:1-1:1 - [c144]Amir Shaikhha, Andrew W. Fitzgibbon, Simon Peyton Jones, Dimitrios Vytiniotis:
Destination-passing style for efficient memory management. FHPC@ICFP 2017: 12-23 - [c143]Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones:
Compiling without continuations. PLDI 2017: 482-494 - [c142]Richard A. Eisenberg, Simon Peyton Jones:
Levity polymorphism. PLDI 2017: 525-539 - [i3]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. CoRR abs/1710.09756 (2017) - 2016
- [j60]Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones, Stephanie Weirich:
Safe zero-cost coercions for Haskell. J. Funct. Program. 26: e15 (2016) - [j59]K. C. Sivaramakrishnan, Tim Harris, Simon Marlow, Simon Peyton Jones:
Composable scheduler activations for Haskell. J. Funct. Program. 26: e9 (2016) - [c141]Simon Peyton Jones, Stephanie Weirich, Richard A. Eisenberg, Dimitrios Vytiniotis:
A Reflection on Types. A List of Successes That Can Change the World 2016: 292-317 - [c140]Matthew Pickering, Gergo Érdi, Simon Peyton Jones, Richard A. Eisenberg:
Pattern synonyms. Haskell 2016: 80-91 - [c139]Simon Marlow, Simon Peyton Jones, Edward Kmett, Andrey Mokhov:
Desugaring Haskell's do-notation into applicative operations. Haskell 2016: 92-104 - [c138]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones, Simon Marlow:
Non-recursive make considered harmful: build systems at scale. Haskell 2016: 170-181 - [c137]Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones:
Sequent calculus as a compiler intermediate language. ICFP 2016: 74-88 - [i2]Shayan Najd, Simon Peyton Jones:
Trees That Grow. CoRR abs/1610.04799 (2016) - 2015
- [j58]Ralf Lämmel, Simon L. Peyton Jones:
ICFP 2004: Scrap More Boilerplate: Reflection, Zips, and Generalised Casts. ACM SIGPLAN Notices 50(8s): 23-34 (2015) - [c136]Jan Stolarek, Simon L. Peyton Jones, Richard A. Eisenberg:
Injective type families for Haskell. Haskell 2015: 118-128 - [c135]Georgios Karachalias, Tom Schrijvers, Dimitrios Vytiniotis, Simon L. Peyton Jones:
GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness. ICFP 2015: 424-436 - [c134]Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Diagnosing type errors with class. PLDI 2015: 12-21 - [c133]Simon Peyton Jones:
The dream of a lifetime: an opportunity to shape how our children learn computing. PPIG 2015: 5 - 2014
- [c132]Joachim Breitner, Richard A. Eisenberg, Simon L. Peyton Jones, Stephanie Weirich:
Safe zero-cost coercions for Haskell. ICFP 2014: 189-202 - [c131]Niki Vazou, Eric L. Seidel, Ranjit Jhala, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Refinement types for Haskell. ICFP 2014: 269-282 - [c130]Scott Kilpatrick, Derek Dreyer, Simon L. Peyton Jones, Simon Marlow:
Backpack: retrofitting Haskell with interfaces. POPL 2014: 19-32 - [c129]Ilya Sergey, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Modular, higher-order cardinality analysis in theory and practice. POPL 2014: 335-348 - [c128]Richard A. Eisenberg, Dimitrios Vytiniotis, Simon L. Peyton Jones, Stephanie Weirich:
Closed type families with overlapping equations. POPL 2014: 671-684 - 2013
- [c127]Geoffrey Mainland, Roman Leshchinskiy, Simon L. Peyton Jones:
Exploiting vector instructions with generalized stream fusio. ICFP 2013: 37-48 - [c126]Simon L. Peyton Jones:
Computer science as a school subject. ICFP 2013: 159-160 - [c125]Simon L. Peyton Jones:
The computing at school working group. ITiCSE 2013: 1 - [c124]Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén:
HALO: haskell to logic through denotational semantics. POPL 2013: 431-442 - [c123]Dimitrios Vytiniotis, Simon L. Peyton Jones:
Evidence Normalization in System FC (Invited Talk). RTA 2013: 20-38 - [c122]Neil Christopher Charles Brown, Michael Kölling, Tom Crick, Simon L. Peyton Jones, Simon Humphreys, Sue Sentance:
Bringing computer science back into schools: lessons from the UK. SIGCSE 2013: 269-274 - [c121]Simon L. Peyton Jones:
Type-Directed Compilation in the Wild: Haskell and Core. TLCA 2013: 1 - 2012
- [c120]Oleg Kiselyov, Simon L. Peyton Jones, Amr Sabry:
Lazy v. Yield: Incremental, Linear Pretty-Printing. APLAS 2012: 190-206 - [c119]Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones:
Guiding parallel array fusion with indexed types. Haskell 2012: 25-36 - [c118]Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Ben Lippmeier, Simon L. Peyton Jones:
Vectorisation avoidance. Haskell 2012: 37-48 - [c117]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe haskell. Haskell 2012: 137-148 - [c116]Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon L. Peyton Jones:
Work efficient higher-order vectorisation. ICFP 2012: 259-270 - [c115]Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães:
Equality proofs and deferred type errors: a compiler pearl. ICFP 2012: 341-352 - [c114]Brent A. Yorgey, Stephanie Weirich, Julien Cretin, Simon L. Peyton Jones, Dimitrios Vytiniotis, José Pedro Magalhães:
Giving Haskell a promotion. TLDI 2012: 53-66 - [i1]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe Haskell. Adv. Math. Commun. 1 (2012) - 2011
- [j57]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers, Martin Sulzmann:
OutsideIn(X) Modular type inference with local assumptions. J. Funct. Program. 21(4-5): 333-412 (2011) - [c113]Maximilian C. Bolingbroke, Simon L. Peyton Jones, Dimitrios Vytiniotis:
Termination combinators forever. Haskell 2011: 23-34 - [c112]Simon Marlow, Ryan Newton, Simon L. Peyton Jones:
A monad for deterministic parallelism. Haskell 2011: 71-82 - [c111]Jeff Epstein, Andrew P. Black, Simon L. Peyton Jones:
Towards Haskell in the cloud. Haskell 2011: 118-129 - [c110]Simon Marlow, Simon L. Peyton Jones:
Multicore garbage collection with local heaps. ISMM 2011: 21-32 - [c109]Stephanie Weirich, Dimitrios Vytiniotis, Simon L. Peyton Jones, Steve Zdancewic:
Generative type abstraction and type-level computation. POPL 2011: 227-240 - 2010
- [c108]Norman Ramsey, João Dias, Simon L. Peyton Jones:
Hoopl: a modular, reusable library for dataflow analysis and transformation. Haskell 2010: 121-134 - [c107]Maximilian C. Bolingbroke, Simon L. Peyton Jones:
Supercompilation by evaluation. Haskell 2010: 135-146 - [c106]Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Ben Lippmeier:
Regular, shape-polymorphic, parallel arrays in Haskell. ICFP 2010: 261-272 - [c105]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers:
Let should not be generalized. TLDI 2010: 39-50 - [p1]Oleg Kiselyov, Simon Peyton Jones, Chung-chieh Shan:
Fun with Type Functions. Reflections on the Work of C. A. R. Hoare 2010: 301-331
2000 – 2009
- 2009
- [c104]Simon L. Peyton Jones:
Classes, Jim, But Not as We Know Them - Type Classes in Haskell: What, Why, and Whither. ECOOP 2009: 1 - [c103]Maximilian C. Bolingbroke, Simon L. Peyton Jones:
Types are calling conventions. Haskell 2009: 1-12 - [c102]Tristan Oliver Richard Allwood, Simon L. Peyton Jones, Susan Eisenbach:
Finding the needle: stack traces for GHC. Haskell 2009: 129-140 - [c101]Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Runtime support for multicore Haskell. ICFP 2009: 65-78 - [c100]Tom Schrijvers, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis:
Complete and decidable type inference for GADTs. ICFP 2009: 341-352 - [c99]Dana N. Xu, Simon L. Peyton Jones, Koen Claessen:
Static contract checking for Haskell. POPL 2009: 41-52 - 2008
- [j56]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. Commun. ACM 51(8): 91-100 (2008) - [c98]Simon L. Peyton Jones, Satnam Singh:
A Tutorial on Parallel and Concurrent Programming in Haskell. Advanced Functional Programming 2008: 267-305 - [c97]Simon L. Peyton Jones:
Harnessing the Multicores: Nested Data Parallelism in Haskell. APLAS 2008: 138 - [c96]Simon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty:
Harnessing the Multicores: Nested Data Parallelism in Haskell. FSTTCS 2008: 383-414 - [c95]Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T. Chakravarty, Martin Sulzmann:
Type checking with open type functions. ICFP 2008: 51-62 - [c94]Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones:
FPH: first-class polymorphism for Haskell. ICFP 2008: 295-306 - [c93]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 - [c92]Barry Jay, Simon L. Peyton Jones:
Scrap Your Type Applications. MPC 2008: 2-27 - 2007
- [j55]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields:
Practical type inference for arbitrary-rank types. J. Funct. Program. 17(1): 1-82 (2007) - [j54]Martin Sulzmann, Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey:
Understanding functional dependencies via constraint handling rules. J. Funct. Program. 17(1): 83-129 (2007) - [j53]R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry:
A monadic framework for delimited continuations. J. Funct. Program. 17(6): 687-730 (2007) - [c91]Simon L. Peyton Jones, Philip Wadler:
Comprehensive comprehensions. Haskell 2007: 61-72 - [c90]Peng Li, Simon Marlow, Simon L. Peyton Jones, Andrew P. Tolmach:
Lightweight concurrency primitives for GHC. Haskell 2007: 107-118 - [c89]Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler:
A history of Haskell: being lazy with class. HOPL 2007: 1-55 - [c88]Simon Marlow, Alexey Rodriguez Yakushev, Simon L. Peyton Jones:
Faster laziness using dynamic pointer tagging. ICFP 2007: 277-288 - [c87]Simon L. Peyton Jones:
Call-pattern specialisation for haskell programs. ICFP 2007: 327-337 - [c86]Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Gabriele Keller, Simon Marlow:
Data parallel Haskell: a status report. DAMP 2007: 10-18 - [c85]Martin Sulzmann, Manuel M. T. Chakravarty, Simon L. Peyton Jones, Kevin Donnelly:
System F with type equality coercions. TLDI 2007: 53-66 - 2006
- [j52]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) - [c84]Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jones:
Haskell Is Not Not ML. ESOP 2006: 38-53 - [c83]Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Lock Free Data Structures Using STM in Haskell. FLOPS 2006: 65-80 - [c82]Gary T. Leavens, Jean-Raymond Abrial, Don S. Batory, Michael J. Butler, Alessandro Coglio, Kathi Fisler, Eric C. R. Hehner, Cliff B. Jones, Dale Miller, Simon L. Peyton Jones, Murali Sitaraman, Douglas R. Smith, Aaron Stump:
Roadmap for enhanced languages and methods to aid verification. GPCE 2006: 221-236 - [c81]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn:
Simple unification-based type inference for GADTs. ICFP 2006: 50-61 - [c80]Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones:
Boxy types: inference for higher-rank types and impredicativity. ICFP 2006: 251-262 - [e6]J. Gregory Morrisett, Simon L. Peyton Jones:
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006. ACM 2006, ISBN 1-59593-027-2 [contents] - 2005
- [c79]Tim Harris, Simon Marlow, Simon L. Peyton Jones:
Haskell on a shared-memory multiprocessor. Haskell 2005: 49-61 - [c78]Ralf Lämmel, Simon L. Peyton Jones:
Scrap your boilerplate with class: extensible generic functions. ICFP 2005: 204-215 - [c77]Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones:
Associated type synonyms. ICFP 2005: 241-253 - [c76]Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow:
Associated types with class. POPL 2005: 1-13 - [c75]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. PPoPP 2005: 48-60 - 2004
- [j51]Clement A. Baker-Finch, Kevin Glynn, Simon L. Peyton Jones:
Constructed product result analysis for Haskell. J. Funct. Program. 14(2): 211-245 (2004) - [c74]Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann:
Sound and Decidable Type Inference for Functional Dependencies. ESOP 2004: 49-63 - [c73]Simon Marlow, Simon L. Peyton Jones, Wolfgang Thaller:
Extending the Haskell foreign function interface with concurrency. Haskell 2004: 22-32 - [c72]Norman Ramsey, Simon L. Peyton Jones:
The C - compiler infrastructure. ICFP 2004: 1 - [c71]Simon Marlow, Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages. ICFP 2004: 4-15 - [c70]Ralf Lämmel, Simon L. Peyton Jones:
Scrap more boilerplate: reflection, zips, and generalised casts. ICFP 2004: 244-255 - [c69]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 - [c68]Alan F. Blackwell, Margaret M. Burnett, Simon L. Peyton Jones:
Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems. VL/HCC 2004: 47-54 - 2003
- [j50]Simon L. Peyton Jones:
Haskell 98: Introduction. J. Funct. Program. 13(1): 0-6 (2003) - [j49]Simon L. Peyton Jones:
Haskell 98: Lexical Structure. J. Funct. Program. 13(1): 7-16 (2003) - [j48]Simon L. Peyton Jones:
Haskell 98: Expressions. J. Funct. Program. 13(1): 17-38 (2003) - [j47]Simon L. Peyton Jones:
Haskell 98: Declarations and Bindings. J. Funct. Program. 13(1): 39-66 (2003) - [j46]Simon L. Peyton Jones:
Haskell 98: Modules. J. Funct. Program. 13(1): 67-80 (2003) - [j45]Simon L. Peyton Jones:
Haskell 98: Predefined Types and Classes. J. Funct. Program. 13(1): 81-96 (2003) - [j44]Simon L. Peyton Jones:
Haskell 98: Basic Input/Output. J. Funct. Program. 13(1): 97-102 (2003) - [j43]Simon L. Peyton Jones:
Haskell 98: Standard Prelude. J. Funct. Program. 13(1): 103-124 (2003) - [j42]Simon L. Peyton Jones:
Haskell 98: Syntax Reference. J. Funct. Program. 13(1): 125-138 (2003) - [j41]Simon L. Peyton Jones:
Haskell 98: Specification of Derived Instances. J. Funct. Program. 13(1): 139-144 (2003) - [j40]Simon L. Peyton Jones:
Haskell 98: Compiler Pragmas. J. Funct. Program. 13(1): 145-146 (2003) - [j39]Simon L. Peyton Jones:
Haskell 98 Libraries: Rational Numbers. J. Funct. Program. 13(1): 149-152 (2003) - [j38]Simon L. Peyton Jones:
Haskell 98 Libraries: Complex Numbers. J. Funct. Program. 13(1): 153-156 (2003) - [j37]Simon L. Peyton Jones:
Haskell 98 Libraries: Numeric Functions. J. Funct. Program. 13(1): 157-168 (2003) - [j36]Simon L. Peyton Jones:
Haskell 98 Libraries: Indexing Operations. J. Funct. Program. 13(1): 169-172 (2003) - [j35]Simon L. Peyton Jones:
Haskell 98 Libraries: Arrays. J. Funct. Program. 13(1): 173-178 (2003) - [j34]Simon L. Peyton Jones:
Haskell 98 Libraries: List Utilities. J. Funct. Program. 13(1): 179-190 (2003) - [j33]Simon L. Peyton Jones:
Haskell 98 Libraries: Maybe Utilities. J. Funct. Program. 13(1): 191-192 (2003) - [j32]Simon L. Peyton Jones:
Haskell 98 Libraries: Character Utilities. J. Funct. Program. 13(1): 193-198 (2003) - [j31]Simon L. Peyton Jones:
Haskell 98 Libraries: Monad Utilities. J. Funct. Program. 13(1): 199-204 (2003) - [j30]Simon L. Peyton Jones:
Haskell 98 Libraries: Input/Output. J. Funct. Program. 13(1): 205-218 (2003) - [j29]Simon L. Peyton Jones:
Haskell 98 Libraries: Directory Functions. J. Funct. Program. 13(1): 219-222 (2003) - [j28]Simon L. Peyton Jones:
Haskell 98 Libraries: System Functions. J. Funct. Program. 13(1): 223-224 (2003) - [j27]Simon L. Peyton Jones:
Haskell 98 Libraries: Dates and Times. J. Funct. Program. 13(1): 225-230 (2003) - [j26]Simon L. Peyton Jones:
Haskell 98 Libraries: Locales. J. Funct. Program. 13(1): 231-232 (2003) - [j25]Simon L. Peyton Jones:
Haskell 98 Libraries: CPU Time. J. Funct. Program. 13(1): 233-234 (2003) - [j24]Simon L. Peyton Jones:
Haskell 98 Libraries: Random Numbers. J. Funct. Program. 13(1): 235-240 (2003) - [j23]Simon L. Peyton Jones:
Haskell 98 Libraries: Bibliography. J. Funct. Program. 13(1): 241-255 (2003) - [j22]Simon L. Peyton Jones, Philip Wadler:
The Educational Pearls column. J. Funct. Program. 13(5): 833-834 (2003) - [c67]Simon L. Peyton Jones, Ralf Lämmel:
Scrap Your Boilerplate. APLAS 2003: 357 - [c66]Robert Ennals, Simon L. Peyton Jones:
HsDebug: debugging lazy programs by not being lazy. Haskell 2003: 84-87 - [c65]Simon L. Peyton Jones, Alan F. Blackwell, Margaret M. Burnett:
A user-centred approach to functions in Excel. ICFP 2003: 165-176 - [c64]Robert Ennals, Simon L. Peyton Jones:
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. ICFP 2003: 287-298 - [c63]Ralf Lämmel, Simon L. Peyton Jones:
Scrap your boilerplate: a practical design pattern for generic programming. TLDI 2003: 26-37 - [e5]Johan Jeuring, Simon L. Peyton Jones:
Advanced Functional Programming, 4th International School, AFP 2002, Oxford, UK, August 19-24, 2002, Revised Lectures. Lecture Notes in Computer Science 2638, Springer 2003, ISBN 3-540-40132-6 [contents] - 2002
- [j21]Simon L. Peyton Jones, Simon Marlow:
Secrets of the Glasgow Haskell Compiler inliner. J. Funct. Program. 12(4&5): 393-433 (2002) - [j20]Tim Sheard, Simon L. Peyton Jones:
Template meta-programming for Haskell. ACM SIGPLAN Notices 37(12): 60-75 (2002) - [c62]Tim Sheard, Simon Peyton Jones:
Template meta-programming for Haskell. Haskell 2002: 1-16 - [e4]Mitchell Wand, Simon L. Peyton Jones:
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), Pittsburgh, Pennsylvania, USA, October 4-6, 2002. ACM 2002, ISBN 1-58113-487-8 [contents] - 2001
- [c61]Simon L. Peyton Jones:
Composing Contracts: An Adventure in Financial Engineering. FME 2001: 435 - [c60]Simon Marlow, Simon L. Peyton Jones, Andrew Moran, John H. Reppy:
Asynchronous Exceptions in Haskell. PLDI 2001: 274-285 - [c59]Mark Shields, Simon L. Peyton Jones:
Object-Oriented Style Overloading for Haskell. BABEL 2001: 89-108 - 2000
- [c58]Philip W. Trinder, Hans-Wolfgang Loidl, Ed. Barry Jr., Kei Davis, Kevin Hammond, Ulrike Klusik, Simon L. Peyton Jones, Álvaro J. Rebón Portillo:
The Multi-architecture Performance of the Parallel Functional Language GP H (Research Note). Euro-Par 2000: 739-743 - [c57]Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, Ronald Lyndon While:
Non-stop Haskell. ICFP 2000: 257-267 - [c56]Simon L. Peyton Jones, Jean-Marc Eber, Julian Seward:
Composing contracts: an adventure in financial engineering, functional pearl. ICFP 2000: 280-292 - [c55]Peter Achten, Simon L. Peyton Jones:
Porting the Clean Object I/O Library to Haskell. IFL 2000: 194-213 - [c54]Norman Ramsey, Simon L. Peyton Jones:
A single intermediate language that supports multiple implementations of exceptions. PLDI 2000: 285-298 - [c53]Martin Erwig, Simon L. Peyton Jones:
Pattern Guards and Transformational Patterns. Haskell 2000: 3 - [c52]Ralf Hinze, Simon L. Peyton Jones:
Derivable Type Classes. Haskell 2000: 5-35
1990 – 1999
- 1999
- [j19]Hans-Wolfgang Loidl, Philip W. Trinder, Kevin Hammond, Sahalu B. Junaidu, Richard G. Morgan, Simon L. Peyton Jones:
Engineering parallel symbolic programs in GPH. Concurr. Pract. Exp. 11(12): 701-752 (1999) - [c51]Oege de Moor, Simon L. Peyton Jones, Eric Van Wyk:
Aspect-Oriented Compilers. GCSE 1999: 121-133 - [c50]Sigbjørn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones:
Calling Hell From Heaven and Heaven From Hell. ICFP 1999: 114-125 - [c49]Simon L. Peyton Jones, Simon Marlow, Conal Elliott:
Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell. IFL 1999: 37-58 - [c48]Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow:
A Semantics for Imprecise Exceptions. PLDI 1999: 25-36 - [c47]Keith Wansbrough, Simon L. Peyton Jones:
Once Upon a Polymorphic Type. POPL 1999: 15-28 - [c46]Simon L. Peyton Jones, Norman Ramsey, Fermin Reig:
C--: A Portable Assembly Language that Supports Garbage Collection. PPDP 1999: 1-28 - [c45]Andrew Moran, Søren B. Lassen, Simon L. Peyton Jones:
Imprecise Exceptions, Co-Inductively. HOOTS 1999: 122-141 - 1998
- [j18]Philip W. Trinder, Kevin Hammond, Hans-Wolfgang Loidl, Simon L. Peyton Jones:
Algorithms + Strategy = Parallelism. J. Funct. Program. 8(1): 23-60 (1998) - [j17]Simon L. Peyton Jones, André L. M. Santos:
A Transformation-Based Optimiser for Haskell. Sci. Comput. Program. 32(1-3): 3-47 (1998) - [c44]Sigbjørn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones:
H/Direct: A Binary Foreign Language Interface for Haskell. ICFP 1998: 153-162 - [c43]Simon Peyton Jones, Erik Meijer, Daan Leijen:
Scripting COM components in Haskell. ICSR 1998: 224-233 - [c42]Simon L. Peyton Jones, Mark Shields, John Launchbury, Andrew P. Tolmach:
Bridging the Gulf: A Common Intermediate Language for ML and Haskell. POPL 1998: 49-61 - [c41]Mark Shields, Tim Sheard, Simon L. Peyton Jones:
Dynamic Typing as Staged Type Inference. POPL 1998: 289-302 - [e3]Simon L. Peyton Jones, Richard E. Jones:
International Symposium on Memory Management, ISMM '98, Vancouver, British Columbia, Canada, 17-19 October, 1998, Conference Proceedings. ACM 1998, ISBN 1-58113-114-3 [contents] - 1997
- [j16]Patrick M. Sansom, Simon L. Peyton Jones:
Formally Based Profiling for Higher-Order Functional Languages. ACM Trans. Program. Lang. Syst. 19(2): 334-385 (1997) - [c40]Simon L. Peyton Jones, Thomas Nordin, Dino Oliva:
C-: A Portable Assembly Language. Implementation of Functional Languages 1997: 1-19 - [c39]Hans-Wolfgang Loidl, Richard G. Morgan, Philip W. Trinder, Sanjay Poria, Chris Cooper, Simon L. Peyton Jones, Roberto Garigliano:
Parallelising a Large Functional Program or: Keeping LOLITA Busy. Implementation of Functional Languages 1997: 198-213 - [e2]Simon L. Peyton Jones, Mads Tofte, A. Michael Berman:
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), Amsterdam, The Netherlands, June 9-11, 1997. ACM 1997, ISBN 0-89791-918-1 [contents] - 1996
- [j15]Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler:
Type Classes in Haskell. ACM Trans. Program. Lang. Syst. 18(2): 109-138 (1996) - [c38]Sigbjørn Finne, Simon L. Peyton Jones:
Composing the User Interface with Haggis. Advanced Functional Programming 1996: 1-37 - [c37]Simon L. Peyton Jones:
Compiling Haskell by Program Transformation: A Report from the Trenches. ESOP 1996: 18-44 - [c36]Simon L. Peyton Jones, Will Partain, André L. M. Santos:
Let-floating: Moving Bindings to Give Faster Programs. ICFP 1996: 1-12 - [c35]Philip W. Trinder, Kevin Hammond, James S. Mattson Jr., Andrew S. Partridge, Simon L. Peyton Jones:
GUM: A Portable Parallel Implementation of Haskell. PLDI 1996: 79-88 - [c34]Simon L. Peyton Jones, Andrew D. Gordon, Sigbjørn Finne:
Concurrent Haskell. POPL 1996: 295-308 - 1995
- [j14]John Launchbury, Simon L. Peyton Jones:
State in Haskell. LISP Symb. Comput. 8(4): 293-341 (1995) - [c33]Sigbjørn Finne, Simon L. Peyton Jones:
Picture: A Simple Structured Graphics Model. Functional Programming 1995: 4 - [c32]Sigbjørn Finne, Simon L. Peyton Jones:
Composing Haggis. Eurographics Workshop on Programming Paradigms in Graphics 1995: 85-101 - [c31]Patrick M. Sansom, Simon L. Peyton Jones:
Time and Space Profiling for Non-Strict Higher-Order Functional Languages. POPL 1995: 355-366 - 1994
- [j13]Rafael Dueire Lins, Simon J. Thompson, Simon L. Peyton Jones:
On the Equivalence Between CMC and TIM. J. Funct. Program. 4(1): 47-63 (1994) - [c30]Kevin Hammond, James S. Mattson Jr., Simon L. Peyton Jones:
Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer. CONPAR 1994: 521-532 - [c29]Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler:
Type Classes in Haskell. ESOP 1994: 241-256 - [c28]Sigbjørn Finne, Simon Peyton Jones:
Programming Reactive Systems in Haskell. Functional Programming 1994: 50-65 - [c27]Cordelia V. Hall, Simon L. Peyton Jones, Patrick M. Sansom:
Unboxing using Specialisation. Functional Programming 1994: 96-110 - [c26]Simon Peyton Jones, André L. M. Santos:
Compilation by Transformation in the Glasgow Haskell Compiler. Functional Programming 1994: 184-204 - [c25]John Launchbury, Simon L. Peyton Jones:
Lazy Funtional State Threads: An Abstract. ICLP 1994: 3-5 - [c24]Andrew John Gill, Simon L. Peyton Jones:
Cheap Deforestation in Practice: An Optimizer for Haskell. IFIP Congress (1) 1994: 581-586 - [c23]John Launchbury, Simon L. Peyton Jones:
Lazy Functional State Threads. PLDI 1994: 24-35 - 1993
- [j12]Simon L. Peyton Jones, John Hughes, John Launchbury:
How to Give a Good Research Talk. ACM SIGPLAN Notices 28(11): 9-12 (1993) - [c22]Simon Peyton Jones, Will Partain:
Measuring the effectiveness of a simple strictness analyser. Functional Programming 1993: 201-221 - [c21]Patrick M. Sansom, Simon L. Peyton Jones:
Generational Garbage Collection for Haskell. FPCA 1993: 106-116 - [c20]Andrew John Gill, John Launchbury, Simon L. Peyton Jones:
A Short Cut to Deforestation. FPCA 1993: 223-232 - [c19]Gert Akerholt, Kevin Hammond, Simon L. Peyton Jones, Philip W. Trinder:
Processing Transactions on GRIP, a Parallel Graph Reducer. PARLE 1993: 634-647 - [c18]Simon L. Peyton Jones, Philip Wadler:
Imperative Functional Programming. POPL 1993: 71-84 - 1992
- [j11]Simon L. Peyton Jones:
Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-Machine. J. Funct. Program. 2(2): 127-202 (1992) - [j10]Joseph H. Fasel, Paul Hudak, Simon L. Peyton Jones, Philip Wadler:
SIGPLAN Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN Notices 27(5): 1 (1992) - [j9]Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph H. Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard B. Kieburtz, Rishiyur S. Nikhil, Will Partain, John Peterson:
Report on the Programming Language Haskell, A Non-strict, Purely Functional Language. ACM SIGPLAN Notices 27(5): 1- (1992) - [c17]Cordelia V. Hall, Kevin Hammond, Will Partain, Simon L. Peyton Jones, Philip Wadler:
The Glasgow Haskell Compiler: A Retrospective. Functional Programming 1992: 62-71 - [c16]John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler:
Avoiding Unnecessary Updates. Functional Programming 1992: 144-153 - [c15]Patrick M. Sansom, Simon L. Peyton Jones:
Profiling Lazy Functional Programs. Functional Programming 1992: 227-239 - [c14]André L. M. Santos, Simon L. Peyton Jones:
On Program Transformation in the Glasgow Haskell Compiler. Functional Programming 1992: 240-251 - 1991
- [j8]Simon L. Peyton Jones, Mark Hardie:
A Futurebus interface from off-the-shelf parts. IEEE Micro 11(1): 38-41 (1991) - [j7]Simon L. Peyton Jones, David R. Lester:
A Modular Fully-lazy Lambda Lifter in HASKELL. Softw. Pract. Exp. 21(5): 479-506 (1991) - [c13]Gert Akerholt, Kevin Hammond, Simon L. Peyton Jones, Philip W. Trinder:
A Parallel Functional Database on GRIP. Functional Programming 1991: 1-24 - [c12]Simon L. Peyton Jones, John Launchbury:
Unboxed Values as First Class Citizens in a Non-Strict Functional Language. FPCA 1991: 636-666 - [e1]Simon L. Peyton Jones, Graham Hutton, Carsten Kehler Holst:
Proceedings of the 1990 Glasgow Workshop on Functional Programming, Ullapool, Scotland, UK, August 13-15, 1990. Workshops in Computing, Springer 1991, ISBN 978-3-540-19667-9 [contents]
1980 – 1989
- 1989
- [j6]Simon L. Peyton Jones:
Parallel Implementations of Functional Programming Languages. Comput. J. 32(2): 175-186 (1989) - [c11]Simon L. Peyton Jones, Jon Salkild:
The Spineless Tagless G-Machine. FPCA 1989: 184-201 - [c10]Simon L. Peyton Jones, Chris D. Clack, Jon Salkild:
High-Performance parallel graph reduction. PARLE (1) 1989: 193-206 - 1988
- [j5]Simon L. Peyton Jones:
FLIC - a functional language intermediate code. ACM SIGPLAN Notices 23(8): 30-48 (1988) - [j4]Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones:
A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56: 17-36 (1988) - [c9]Geoffrey Livingston Burn, Simon L. Peyton Jones, J. D. Robson:
The Spineless G-Machine. LISP and Functional Programming 1988: 244-258 - 1987
- [b1]Simon L. Peyton Jones:
The Implementation of Functional Programming Languages. Prentice-Hall 1987 - [c8]Simon L. Peyton Jones, Chris D. Clack, Jon Salkild, Mark Hardie:
GRIP - A high-performance architecture for parallel graph reduction. FPCA 1987: 98-112 - 1986
- [j3]Simon L. Peyton Jones:
Parsing Distfix Operators. Commun. ACM 29(2): 118-122 (1986) - [j2]Simon Peyton Jones:
Using Futurebus in a fifth-generation computer. Microprocess. Microsystems 10(2): 69-76 (1986) - [c7]Simon L. Peyton Jones:
Functional Programming Languages as a Software Engineering Tool. Embedded Systems 1986: 153-173 - [c6]Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones:
A Safe Approach to Parallel Combinator Reduction (Extended Abstract). ESOP 1986: 99-110 - [c5]Chris D. Clack, Simon L. Peyton Jones:
The Four-Stroke Reduction Engine. LISP and Functional Programming 1986: 220-232 - 1985
- [j1]Simon L. Peyton Jones:
Yacc in Sasl-an Exercise in Functional Programming. Softw. Pract. Exp. 15(8): 807-820 (1985) - [c4]Chris D. Clack, Simon L. Peyton Jones:
Strictness Analysis - A Practical Approach. FPCA 1985: 35-49 - [c3]Simon L. Peyton Jones:
An Introduction to Fully-Lazy Supercombinators. Combinators and Functional Programming Languages 1985: 175-206 - 1982
- [c2]Simon L. Peyton Jones:
An Investigation of the Relative Efficiencies of Combinators and Lambda Expressions. Symposium on LISP and Functional Programming 1982: 150-158 - 1981
- [c1]N. C. L. Beale, Simon L. Peyton Jones:
An ADATM compatible specification language. ACM Annual Conference 1981: 139-143
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 2025-06-17 00:16 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:
