Search results

Jump to navigation Jump to search

Page title matches

  • ...ou do just that. Here's a link back to my [http://research.microsoft.com/~simonpj home page], from where you can get to all my papers. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    5 KB (755 words) - 20:00, 30 October 2007
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/list-comp Comprehensive Comprehensions]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    11 KB (1,836 words) - 02:36, 25 September 2007
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/lw-conc Lightweight concurrency primitives for GHC]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    3 KB (497 words) - 19:06, 11 February 2008
  • ...ughts and presentations about these skills [http://research.microsoft.com/~simonpj/papers/giving-a-talk/giving-a-talk.htm here], but this page is for you! ...is Wiki page. Please add your comments on [http://research.microsoft.com/~simonpj/papers/giving-a-talk/giving-a-talk.htm my material], your own thoughts and
    900 bytes (139 words) - 08:45, 19 September 2008
  • ...a discussion page for the Haskell tutorial [http://research.microsoft.com/~simonpj/papers/haskell-tutorial A taste of Haskell], delivered at OSCON 2007. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    1 KB (230 words) - 23:25, 2 December 2007
  • This is a discussion page for my talk about [http://research.microsoft.com/~simonpj/papers/haskell-effects taming effects]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    761 bytes (123 words) - 14:50, 6 March 2008
  • * '''[http://research.microsoft.com/~simonpj/papers/assoc-types/fun-with-type-funs/typefun.pdf Fun With Type Functions ( * '''[http://research.microsoft.com/~simonpj/papers/assoc-types/fun-with-type-funs/FunWithTypeFuns-Apr09.pdf Slides (PDF
    14 KB (2,191 words) - 17:03, 18 February 2012
  • * '''[http://research.microsoft.com/~simonpj/papers/constraints/index.htm Related papers (constraints)]''' * '''[http://research.microsoft.com/~simonpj/papers/gadt/index.htm Related papers (GADTs)]'''
    9 KB (1,527 words) - 09:11, 10 August 2022

Page text matches

  • This is a discussion page for my talk about [http://research.microsoft.com/~simonpj/papers/haskell-effects taming effects]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    761 bytes (123 words) - 14:50, 6 March 2008
  • ...ughts and presentations about these skills [http://research.microsoft.com/~simonpj/papers/giving-a-talk/giving-a-talk.htm here], but this page is for you! ...is Wiki page. Please add your comments on [http://research.microsoft.com/~simonpj/papers/giving-a-talk/giving-a-talk.htm my material], your own thoughts and
    900 bytes (139 words) - 08:45, 19 September 2008
  • ...a discussion page for the Haskell tutorial [http://research.microsoft.com/~simonpj/papers/haskell-tutorial A taste of Haskell], delivered at OSCON 2007. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    1 KB (230 words) - 23:25, 2 December 2007
  • ...ou do just that. Here's a link back to my [http://research.microsoft.com/~simonpj home page], from where you can get to all my papers. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    5 KB (755 words) - 20:00, 30 October 2007
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/lw-conc Lightweight concurrency primitives for GHC]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    3 KB (497 words) - 19:06, 11 February 2008
  • == Response from SimonPJ == [[http://research.microsoft.com/en-us/um/people/simonpj/papers/derive.htm
    7 KB (1,197 words) - 19:49, 1 May 2010
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/list-comp Comprehensive Comprehensions]. :[[User:Simonpj|Simonpj]] 08:42, 19 April 2007 (UTC) Note from Simon
    11 KB (1,836 words) - 02:36, 25 September 2007
  • * Divide benchmarks into imaginary, spectral and real (just like nofib did). (SimonPJ)
    5 KB (697 words) - 16:59, 10 March 2011
  • Cc: hudak@yale.edu, simonpj@dcs.glasgow.ac.uk, wadler@dcs.glasgow.ac.uk
    4 KB (583 words) - 10:26, 26 December 2017
  • * '''[http://research.microsoft.com/~simonpj/papers/assoc-types/fun-with-type-funs/typefun.pdf Fun With Type Functions ( * '''[http://research.microsoft.com/~simonpj/papers/assoc-types/fun-with-type-funs/FunWithTypeFuns-Apr09.pdf Slides (PDF
    14 KB (2,191 words) - 17:03, 18 February 2012
  • * '''[http://research.microsoft.com/~simonpj/papers/constraints/index.htm Related papers (constraints)]''' * '''[http://research.microsoft.com/~simonpj/papers/gadt/index.htm Related papers (GADTs)]'''
    9 KB (1,527 words) - 09:11, 10 August 2022
  • ...ordinary data declarations define completely unrelated types. A recent [[Simonpj/Talk:FunWithTypeFuns|tutorial paper]] has more in-depth examples of program * [[Simonpj/Talk:FunWithTypeFuns | Fun with Type Functions]] Oleg Kiselyov, Simon Peyto
    42 KB (6,828 words) - 17:15, 4 February 2023
  • From: Simon Peyton-Jones <simonpj@microsoft.com> Subject: RE: [Haskell] Re: [Haskell-cafe] SimonPJ and Tim Harris explain STM
    24 KB (3,463 words) - 05:20, 12 July 2021