The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Simon L. Peyton Jones: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chris D. Clack, Simon L. Peyton Jones
    Strictness Analysis - A Practical Approach. [Citation Graph (2, 0)][DBLP]
    FPCA, 1985, pp:35-49 [Conf]
  2. John Launchbury, Simon L. Peyton Jones
    Lazy Functional State Threads. [Citation Graph (1, 0)][DBLP]
    PLDI, 1994, pp:24-35 [Conf]
  3. Simon L. Peyton Jones, Philip Wadler
    Imperative Functional Programming. [Citation Graph (1, 0)][DBLP]
    POPL, 1993, pp:71-84 [Conf]
  4. 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. [Citation Graph (1, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:5, pp:0-0 [Journal]
  5. Simon L. Peyton Jones
    Functional Programming Languages as a Software Engineering Tool. [Citation Graph (0, 0)][DBLP]
    Embedded Systems, 1986, pp:153-173 [Conf]
  6. Sigbjorn Finne, Simon L. Peyton Jones
    Composing the User Interface with Haggis. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1996, pp:1-37 [Conf]
  7. Simon L. Peyton Jones, Ralf Lämmel
    Scrap Your Boilerplate. [Citation Graph (0, 0)][DBLP]
    APLAS, 2003, pp:357- [Conf]
  8. Kevin Hammond, James S. Mattson Jr., Simon L. Peyton Jones
    Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:521-532 [Conf]
  9. Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann
    Sound and Decidable Type Inference for Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    ESOP, 2004, pp:49-63 [Conf]
  10. Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler
    Type Classes in Haskell. [Citation Graph (0, 0)][DBLP]
    ESOP, 1994, pp:241-256 [Conf]
  11. Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones
    A Safe Approach to Parallel Combinator Reduction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:99-110 [Conf]
  12. Simon L. Peyton Jones
    Compiling Haskell by Program Transformation: A Report from the Trenches. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:18-44 [Conf]
  13. Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jones
    Haskell Is Not Not ML. [Citation Graph (0, 0)][DBLP]
    ESOP, 2006, pp:38-53 [Conf]
  14. 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). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:739-743 [Conf]
  15. Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh
    Lock Free Data Structures Using STM in Haskell. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2006, pp:65-80 [Conf]
  16. Simon L. Peyton Jones
    Composing Contracts: An Adventure in Financial Engineering. [Citation Graph (0, 0)][DBLP]
    FME, 2001, pp:435- [Conf]
  17. John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler
    Avoiding Unnecessary Updates. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:144-153 [Conf]
  18. Gert Akerholt, Kevin Hammond, Simon L. Peyton Jones, Philip W. Trinder
    A Parallel Functional Database on GRIP. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:1-24 [Conf]
  19. Patrick M. Sansom, Simon L. Peyton Jones
    Profiling Lazy Functional Programs. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:227-239 [Conf]
  20. André Santos, Simon L. Peyton Jones
    On Program Transformation in the Glasgow Haskell Compiler. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:240-251 [Conf]
  21. Sigbjorn Finne, Simon L. Peyton Jones
    Picture: A Simple Structured Graphics Model. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1995, pp:4- [Conf]
  22. Cordelia V. Hall, Kevin Hammond, Will Partain, Simon L. Peyton Jones, Philip Wadler
    The Glasgow Haskell Compiler: A Retrospective. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:62-71 [Conf]
  23. Simon L. Peyton Jones, Chris D. Clack, Jon Salkild, Mark Hardie
    GRIP - A high-performance architecture for parallel graph reduction. [Citation Graph (0, 0)][DBLP]
    FPCA, 1987, pp:98-112 [Conf]
  24. Simon L. Peyton Jones, John Launchbury
    Unboxed Values as First Class Citizens in a Non-Strict Functional Language. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:636-666 [Conf]
  25. Simon L. Peyton Jones, Jon Salkild
    The Spineless Tagless G-Machine. [Citation Graph (0, 0)][DBLP]
    FPCA, 1989, pp:184-201 [Conf]
  26. Andrew J. Gill, John Launchbury, Simon L. Peyton Jones
    A Short Cut to Deforestation. [Citation Graph (0, 0)][DBLP]
    FPCA, 1993, pp:223-232 [Conf]
  27. Patrick M. Sansom, Simon L. Peyton Jones
    Generational Garbage Collection for Haskell. [Citation Graph (0, 0)][DBLP]
    FPCA, 1993, pp:106-116 [Conf]
  28. Oege de Moor, Simon L. Peyton Jones, Eric Van Wyk
    Aspect-Oriented Compilers. [Citation Graph (0, 0)][DBLP]
    GCSE, 1999, pp:121-133 [Conf]
  29. Gary T. Leavens, Jean-Raymond Abrial, Don S. Batory, Michael 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. [Citation Graph (0, 0)][DBLP]
    GPCE, 2006, pp:221-236 [Conf]
  30. Robert Ennals, Simon L. Peyton Jones
    Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 2003, pp:287-298 [Conf]
  31. Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones
    H/Direct: A Binary Foreign Language Interface for Haskell. [Citation Graph (0, 0)][DBLP]
    ICFP, 1998, pp:153-162 [Conf]
  32. Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones
    Calling Hell From Heaven and Heaven From Hell. [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:114-125 [Conf]
  33. Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones
    Associated type synonyms. [Citation Graph (0, 0)][DBLP]
    ICFP, 2005, pp:241-253 [Conf]
  34. Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, R. Lyndon While
    Non-stop Haskell. [Citation Graph (0, 0)][DBLP]
    ICFP, 2000, pp:257-267 [Conf]
  35. Simon L. Peyton Jones, Alan F. Blackwell, Margaret M. Burnett
    A user-centred approach to functions in Excel. [Citation Graph (0, 0)][DBLP]
    ICFP, 2003, pp:165-176 [Conf]
  36. Simon L. Peyton Jones, Jean-Marc Eber, Julian Seward
    Composing contracts: an adventure in financial engineering, functional pearl. [Citation Graph (0, 0)][DBLP]
    ICFP, 2000, pp:280-292 [Conf]
  37. Simon L. Peyton Jones, Will Partain, André Santos
    Let-floating: Moving Bindings to Give Faster Programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:1-12 [Conf]
  38. Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn
    Simple unification-based type inference for GADTs. [Citation Graph (0, 0)][DBLP]
    ICFP, 2006, pp:50-61 [Conf]
  39. Ralf Lämmel, Simon L. Peyton Jones
    Scrap more boilerplate: reflection, zips, and generalised casts. [Citation Graph (0, 0)][DBLP]
    ICFP, 2004, pp:244-255 [Conf]
  40. Ralf Lämmel, Simon L. Peyton Jones
    Scrap your boilerplate with class: extensible generic functions. [Citation Graph (0, 0)][DBLP]
    ICFP, 2005, pp:204-215 [Conf]
  41. Simon Marlow, Simon L. Peyton Jones
    Making a fast curry: push/enter vs. eval/apply for higher-order languages. [Citation Graph (0, 0)][DBLP]
    ICFP, 2004, pp:4-15 [Conf]
  42. Norman Ramsey, Simon L. Peyton Jones
    The C - compiler infrastructure. [Citation Graph (0, 0)][DBLP]
    ICFP, 2004, pp:1- [Conf]
  43. Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones
    Boxy types: inference for higher-rank types and impredicativity. [Citation Graph (0, 0)][DBLP]
    ICFP, 2006, pp:251-262 [Conf]
  44. John Launchbury, Simon L. Peyton Jones
    Lazy Funtional State Threads: An Abstract. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:3-5 [Conf]
  45. Andrew J. Gill, Simon L. Peyton Jones
    Cheap Deforestation in Practice: An Optimizer for Haskell. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:581-586 [Conf]
  46. Peter Achten, Simon L. Peyton Jones
    Porting the Clean Object I/O Library to Haskell. [Citation Graph (0, 0)][DBLP]
    IFL, 2000, pp:194-213 [Conf]
  47. 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. [Citation Graph (0, 0)][DBLP]
    Implementation of Functional Languages, 1997, pp:198-213 [Conf]
  48. Simon L. Peyton Jones, Simon Marlow, Conal Elliott
    Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell. [Citation Graph (0, 0)][DBLP]
    IFL, 1999, pp:37-58 [Conf]
  49. Simon L. Peyton Jones, Thomas Nordin, Dino Oliva
    C-: A Portable Assembly Language. [Citation Graph (0, 0)][DBLP]
    Implementation of Functional Languages, 1997, pp:1-19 [Conf]
  50. Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, R. Lyndon While
    Exploring the barrier to entry: incremental generational garbage collection for Haskell. [Citation Graph (0, 0)][DBLP]
    ISMM, 2004, pp:163-174 [Conf]
  51. Geoffrey L. Burn, Simon L. Peyton Jones, J. D. Robson
    The Spineless G-Machine. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1988, pp:244-258 [Conf]
  52. Chris D. Clack, Simon L. Peyton Jones
    The Four-Stroke Reduction Engine. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1986, pp:220-232 [Conf]
  53. Simon L. Peyton Jones
    An Investigation of the Relative Efficiencies of Combinators and Lambda Expressions. [Citation Graph (0, 0)][DBLP]
    Symposium on LISP and Functional Programming, 1982, pp:150-158 [Conf]
  54. Simon L. Peyton Jones
    An Introduction to Fully-Lazy Supercombinators. [Citation Graph (0, 0)][DBLP]
    Combinators and Functional Programming Languages, 1985, pp:175-206 [Conf]
  55. Sigbjorn Finne, Simon L. Peyton Jones
    Composing Haggis. [Citation Graph (0, 0)][DBLP]
    Eurographics Workshop on Programming Paradigms in Graphics, 1995, pp:85-101 [Conf]
  56. Gert Akerholt, Kevin Hammond, Simon L. Peyton Jones, Philip W. Trinder
    Processing Transactions on GRIP, a Parallel Graph Reducer. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:634-647 [Conf]
  57. Simon L. Peyton Jones, Chris D. Clack, Jon Salkild
    High-Performance parallel graph reduction. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1989, pp:193-206 [Conf]
  58. Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow
    A Semantics for Imprecise Exceptions. [Citation Graph (0, 0)][DBLP]
    PLDI, 1999, pp:25-36 [Conf]
  59. Simon Marlow, Simon L. Peyton Jones, Andrew Moran, John H. Reppy
    Asynchronous Exceptions in Haskell. [Citation Graph (0, 0)][DBLP]
    PLDI, 2001, pp:274-285 [Conf]
  60. Norman Ramsey, Simon L. Peyton Jones
    A single intermediate language that supports multiple implementations of exceptions. [Citation Graph (0, 0)][DBLP]
    PLDI, 2000, pp:285-298 [Conf]
  61. Philip W. Trinder, Kevin Hammond, James S. Mattson Jr., A. S. Partridge, Simon L. Peyton Jones
    GUM: A Portable Parallel Implementation of Haskell. [Citation Graph (0, 0)][DBLP]
    PLDI, 1996, pp:79-88 [Conf]
  62. Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow
    Associated types with class. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:1-13 [Conf]
  63. Simon L. Peyton Jones, Andrew Gordon, Sigbjorn Finne
    Concurrent Haskell. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:295-308 [Conf]
  64. Simon L. Peyton Jones, Mark Shields, John Launchbury, Andrew P. Tolmach
    Bridging the Gulf: A Common Intermediate Language for ML and Haskell. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:49-61 [Conf]
  65. Patrick M. Sansom, Simon L. Peyton Jones
    Time and Space Profiling for Non-Strict Higher-Order Functional Languages. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:355-366 [Conf]
  66. Mark Shields, Tim Sheard, Simon L. Peyton Jones
    Dynamic Typing as Staged Type Inference. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:289-302 [Conf]
  67. Keith Wansbrough, Simon L. Peyton Jones
    Once Upon a Polymorphic Type. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:15-28 [Conf]
  68. Simon L. Peyton Jones, Norman Ramsey, Fermin Reig
    C--: A Portable Assembly Language that Supports Garbage Collection. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:1-28 [Conf]
  69. Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy
    Composable memory transactions. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2005, pp:48-60 [Conf]
  70. Ralf Lämmel, Simon L. Peyton Jones
    Scrap your boilerplate: a practical design pattern for generic programming. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:26-37 [Conf]
  71. Ralf Lämmel, Simon L. Peyton Jones
    Scrap your boilerplate: a practical design pattern for generic programming. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:26-37 [Conf]
  72. Martin Sulzmann, Manuel M. T. Chakravarty, Simon L. Peyton Jones, Kevin Donnelly
    System F with type equality coercions. [Citation Graph (0, 0)][DBLP]
    TLDI, 2007, pp:53-66 [Conf]
  73. Alan F. Blackwell, Margaret M. Burnett, Simon L. Peyton Jones
    Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems. [Citation Graph (0, 0)][DBLP]
    VL/HCC, 2004, pp:47-54 [Conf]
  74. Simon L. Peyton Jones
    Parsing Distfix Operators. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:2, pp:118-122 [Journal]
  75. Simon L. Peyton Jones
    Parallel Implementations of Functional Programming Languages. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:2, pp:175-186 [Journal]
  76. Hans-Wolfgang Loidl, Philip W. Trinder, Kevin Hammond, Sahalu B. Junaidu, Richard G. Morgan, Simon L. Peyton Jones
    Engineering parallel symbolic programs in GPH. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1999, v:11, n:12, pp:701-752 [Journal]
  77. Martin Erwig, Simon L. Peyton Jones
    Pattern Guards and Transformational Patterns. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:1, pp:- [Journal]
  78. Ralf Hinze, Simon L. Peyton Jones
    Derivable Type Classes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:1, pp:- [Journal]
  79. Andrew Moran, Søren B. Lassen, Simon L. Peyton Jones
    Imprecise Exceptions, Co-Inductively. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:26, n:, pp:- [Journal]
  80. Clement A. Baker-Finch, Kevin Glynn, Simon L. Peyton Jones
    Constructed product result analysis for Haskell. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:2, pp:211-245 [Journal]
  81. Simon L. Peyton Jones
    Haskell 98 Libraries: Bibliography. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:241-255 [Journal]
  82. Simon L. Peyton Jones
    Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-Machine. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:2, pp:127-202 [Journal]
  83. Simon L. Peyton Jones, Simon Marlow
    Secrets of the Glasgow Haskell Compiler inliner. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2002, v:12, n:4&5, pp:393-433 [Journal]
  84. Simon L. Peyton Jones, Philip Wadler
    The Educational Pearls column. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:5, pp:833-834 [Journal]
  85. Simon L. Peyton Jones
    Haskell 98: Introduction. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:0-6 [Journal]
  86. Simon L. Peyton Jones
    Haskell 98: Lexical Structure. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:7-16 [Journal]
  87. Simon L. Peyton Jones
    Haskell 98: Expressions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:17-38 [Journal]
  88. Simon L. Peyton Jones
    Haskell 98: Declarations and Bindings. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:39-66 [Journal]
  89. Simon L. Peyton Jones
    Haskell 98: Modules. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:67-80 [Journal]
  90. Simon L. Peyton Jones
    Haskell 98: Predefined Types and Classes. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:81-96 [Journal]
  91. Simon L. Peyton Jones
    Haskell 98: Basic Input/Output. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:97-102 [Journal]
  92. Simon L. Peyton Jones
    Haskell 98: Standard Prelude. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:103-124 [Journal]
  93. Simon L. Peyton Jones
    Haskell 98: Syntax Reference. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:125-138 [Journal]
  94. Simon L. Peyton Jones
    Haskell 98: Specification of Derived Instances. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:139-144 [Journal]
  95. Simon L. Peyton Jones
    Haskell 98: Compiler Pragmas. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:145-146 [Journal]
  96. Simon L. Peyton Jones
    Haskell 98 Libraries: Rational Numbers. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:149-152 [Journal]
  97. Rafael Dueire Lins, Simon J. Thompson, Simon L. Peyton Jones
    On the Equivalence Between CMC and TIM. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1994, v:4, n:1, pp:47-63 [Journal]
  98. Simon L. Peyton Jones
    Haskell 98 Libraries: Complex Numbers. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:153-156 [Journal]
  99. Simon L. Peyton Jones
    Haskell 98 Libraries: Numeric Functions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:157-168 [Journal]
  100. Simon L. Peyton Jones
    Haskell 98 Libraries: Indexing Operations. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:169-172 [Journal]
  101. Simon L. Peyton Jones
    Haskell 98 Libraries: Arrays. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:173-178 [Journal]
  102. Simon L. Peyton Jones
    Haskell 98 Libraries: List Utilities. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:179-190 [Journal]
  103. Simon L. Peyton Jones
    Haskell 98 Libraries: Maybe Utilities. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:191-192 [Journal]
  104. Simon L. Peyton Jones
    Haskell 98 Libraries: Character Utilities. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:193-198 [Journal]
  105. Simon L. Peyton Jones
    Haskell 98 Libraries: Monad Utilities. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:199-204 [Journal]
  106. Simon L. Peyton Jones
    Haskell 98 Libraries: Input/Output. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:205-218 [Journal]
  107. Simon L. Peyton Jones
    Haskell 98 Libraries: Directory Functions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:219-222 [Journal]
  108. Simon L. Peyton Jones
    Haskell 98 Libraries: System Functions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:223-224 [Journal]
  109. Simon L. Peyton Jones
    Haskell 98 Libraries: Dates and Times. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:225-230 [Journal]
  110. Simon L. Peyton Jones
    Haskell 98 Libraries: Locales. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:231-232 [Journal]
  111. Simon L. Peyton Jones
    Haskell 98 Libraries: CPU Time. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:233-234 [Journal]
  112. Simon L. Peyton Jones
    Haskell 98 Libraries: Random Numbers. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:1, pp:235-240 [Journal]
  113. Philip W. Trinder, Kevin Hammond, Hans-Wolfgang Loidl, Simon L. Peyton Jones
    Algorithms + Strategy = Parallelism. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:1, pp:23-60 [Journal]
  114. Martin Sulzmann, Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey
    Understanding functional dependencies via constraint handling rules. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2007, v:17, n:1, pp:83-129 [Journal]
  115. Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields
    Practical type inference for arbitrary-rank types. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2007, v:17, n:1, pp:1-82 [Journal]
  116. Simon Marlow, Simon L. Peyton Jones
    Making a fast curry: push/enter vs. eval/apply for higher-order languages. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2006, v:16, n:4-5, pp:415-449 [Journal]
  117. John Launchbury, Simon L. Peyton Jones
    State in Haskell. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1995, v:8, n:4, pp:293-341 [Journal]
  118. Simon L. Peyton Jones, André L. M. Santos
    A Transformation-Based Optimiser for Haskell. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:32, n:1-3, pp:3-47 [Journal]
  119. Joseph H. Fasel, Paul Hudak, Simon L. Peyton Jones, Philip Wadler
    SIGPLAN Notices Special Issue on the Functional Programming Language Haskell. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:5, pp:1- [Journal]
  120. Simon L. Peyton Jones
    FLIC - a functional language intermediate code. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1988, v:23, n:8, pp:30-48 [Journal]
  121. Simon L. Peyton Jones, John Hughes, John Launchbury
    How to Give a Good Research Talk. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1993, v:28, n:11, pp:9-12 [Journal]
  122. Tim Sheard, Simon L. Peyton Jones
    Template meta-programming for Haskell. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2002, v:37, n:12, pp:60-75 [Journal]
  123. Simon L. Peyton Jones
    Yacc in Sasl-an Exercise in Functional Programming. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1985, v:15, n:8, pp:807-820 [Journal]
  124. Simon L. Peyton Jones, David Lester
    A Modular Fully-lazy Lambda Lifter in HASKELL. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1991, v:21, n:5, pp:479-506 [Journal]
  125. Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones
    A Safe Approach to Parallel Combinator Reduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:17-36 [Journal]
  126. Mark Shields, Simon L. Peyton Jones
    Object-Oriented Style Overloading for Haskell. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:59, n:1, pp:- [Journal]
  127. Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler
    Type Classes in Haskell. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:2, pp:109-138 [Journal]
  128. Patrick M. Sansom, Simon L. Peyton Jones
    Formally Based Profiling for Higher-Order Functional Languages. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:2, pp:334-385 [Journal]
  129. Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler
    A history of Haskell: being lazy with class. [Citation Graph (0, 0)][DBLP]
    HOPL, 2007, pp:1-55 [Conf]
  130. Simon L. Peyton Jones
    Call-pattern specialisation for haskell programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 2007, pp:327-337 [Conf]
  131. Simon Marlow, Alexey Rodriguez Yakushev, Simon L. Peyton Jones
    Faster laziness using dynamic pointer tagging. [Citation Graph (0, 0)][DBLP]
    ICFP, 2007, pp:277-288 [Conf]
  132. Simon L. Peyton Jones, Philip Wadler
    Comprehensive comprehensions. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:61-72 [Conf]
  133. Peng Li, Simon Marlow, Simon L. Peyton Jones, Andrew P. Tolmach
    Lightweight concurrency primitives for GHC. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:107-118 [Conf]
  134. Tim Harris, Simon Marlow, Simon L. Peyton Jones
    Haskell on a shared-memory multiprocessor. [Citation Graph (0, 0)][DBLP]
    Haskell, 2005, pp:49-61 [Conf]

  135. A Tutorial on Parallel and Concurrent Programming in Haskell. [Citation Graph (, )][DBLP]


  136. Harnessing the Multicores: Nested Data Parallelism in Haskell. [Citation Graph (, )][DBLP]


  137. Classes, Jim, But Not as We Know Them - Type Classes in Haskell: What, Why, and Whither. [Citation Graph (, )][DBLP]


  138. Harnessing the Multicores: Nested Data Parallelism in Haskell. [Citation Graph (, )][DBLP]


  139. Runtime support for multicore Haskell. [Citation Graph (, )][DBLP]


  140. Type checking with open type functions. [Citation Graph (, )][DBLP]


  141. FPH: first-class polymorphism for Haskell. [Citation Graph (, )][DBLP]


  142. Complete and decidable type inference for GADTs. [Citation Graph (, )][DBLP]


  143. Parallel generational-copying garbage collection with a block-structured heap. [Citation Graph (, )][DBLP]


  144. Scrap Your Type Applications. [Citation Graph (, )][DBLP]


  145. Static contract checking for Haskell. [Citation Graph (, )][DBLP]


  146. Data parallel Haskell: a status report. [Citation Graph (, )][DBLP]


  147. Let should not be generalized. [Citation Graph (, )][DBLP]


  148. Types are calling conventions. [Citation Graph (, )][DBLP]


  149. Composable memory transactions. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.050secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002