Search results

Jump to navigation Jump to search
  • * Paper "Comparing Libraries For Generic Programming In Haskell": [http://www.cs.uu
    950 bytes (130 words) - 10:56, 6 March 2010
  • ...e [http://www.cis.upenn.edu/~eir/papers/2014/coercible/coercible.pdf draft paper] for useful information.
    637 bytes (99 words) - 19:03, 8 April 2014
  • [http://www.haskell.org/wikiupload/1/15/Paper-v5.sxw Download .sxw ] After loading the .sxw in the Open Office, press the [http://www.haskell.org/wikiupload/7/7d/POPA_D.pdf Official PDF of the paper for <DOWNLOAD> ], having the following title:
    6 KB (867 words) - 08:50, 26 July 2011
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/list-comp Comprehensive Comp If you are kind enough to read this paper, you may like to jot down any thoughts it triggers off, and see what others
    11 KB (1,836 words) - 02:36, 25 September 2007
  • The paper is available:
    1 KB (177 words) - 11:09, 12 November 2011
  • ...(FSTTCS 2008),'' IBFI, Schloss Dagstuhl, 2008. '''''Summary:''''' ''This paper gives a comprehensive account of the vectorisation of Haskell programs and ...icrosoft.com/~simonpj/papers/ndp/NdpSlides.pdf slides of a talk] about the paper.
    8 KB (1,153 words) - 13:18, 2 December 2008
  • ...doi=10.1.1.67.3686&rep=rep1&type=pdf Composable memory transactions]. The paper [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.64.1678&rep=rep1 ...to know about ''bound threads''. They are described in a Haskell workshop paper, [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.4811&rep=rep
    4 KB (479 words) - 09:56, 15 May 2024
  • ...itecture of the new solver, which is inspired by Nordin and Tolmach's 2001 paper ``Modular Lazy Search for Constraint Satisfaction Problems''. We also point
    1 KB (228 words) - 13:46, 17 December 2012
  • Here is Version 3 of our paper (May 2010): This paper gives a programmer's tour of type families as they are
    14 KB (2,191 words) - 17:03, 18 February 2012
  • in the original Cloud Haskell paper) and a potential solution.
    1 KB (203 words) - 13:43, 17 December 2012
  • ...about an hour and [http://citeseer.ist.psu.edu/claessen00quickcheck.html a paper from John Hughes ].
    1 KB (230 words) - 23:25, 2 December 2007
  • -- oriented subsets of the paper (of type Bound) are above each other.
    2 KB (328 words) - 10:49, 13 January 2007
  • .../gmh/ Graham Hutton] and Erik Meier). The optimalisations described in the paper are avoided here. Of course, we can make optimalisations, or choose sophist
    4 KB (583 words) - 14:31, 4 August 2006
  • Further details can be found in the draft paper available from the [http://wiki.di.uminho.pt/twiki/bin/view/Research/PURe/C
    1 KB (209 words) - 10:14, 6 May 2007
  • ...lpful. It's hard for me to extract examples from the McBride and Paterson paper, because of the notation and because the examples are mixed in with the axi ...o any module where the description contains a link to a PDF of an academic paper and no examples.)
    4 KB (549 words) - 05:29, 20 January 2010
  • :* Latest paper: [http://research.microsoft.com/apps/pubs/default.aspx?id=138042 Seq no mor :* Original paper: [http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html
    7 KB (1,001 words) - 21:55, 10 May 2024
  • ...nges and then possibly go around the cycle again. If you haven't written a paper before then expect at least two cycles. ...ttp://www.program-transformation.org/PEPM13/ToolPaperAdvice PEPM 2013 Tool paper advice]
    5 KB (901 words) - 09:06, 1 May 2013
  • and Dynamic types (which have special attention in the paper)</li></p> RepLib (caveat: haven't read that paper carefully) are in a similar
    5 KB (859 words) - 10:10, 20 April 2021
  • ...eautiful-differentiation/ Beautiful differentiation by Conal Elliott.] The paper itself and link to video of ICFP talk on the subject are available from his
    3 KB (357 words) - 08:32, 19 December 2010
  • ...h interesting new possibilities for browsers. ''(The link is broken, but a paper with the code of an old version can be downloaded from [http://www.unibw.de
    2 KB (345 words) - 10:15, 30 March 2008
  • In his paper [https://academic.oup.com/comjnl/article-pdf/31/3/243/1157325/310243.pdf No While they recognise its preservation of referential transparency, in their paper [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.46.1260&rep=rep1
    6 KB (809 words) - 07:56, 12 June 2023
  • POPL 2011 paper, "Generative type abstraction and type-level computation."
    1 KB (187 words) - 06:34, 16 September 2013
  • ...k> is an indirection to one or the other, for testing. See Doug McIlroy's paper "The Music of Streams".
    3 KB (384 words) - 19:07, 11 November 2008
  • of the paper.) to local instance declarations. Our ICFP'08 paper
    7 KB (1,197 words) - 19:49, 1 May 2010
  • ...c/summary?doi=10.1.1.27.7800 What is a Purely Functional Language?] a 1993 paper which presents a proposed formal definition of the concept,
    2 KB (290 words) - 08:52, 24 April 2024
  • ...ndstroem.wordpress.com/2008/09/18/metahdbc-paper-draft/ the MetaHDBC draft paper] will help you get started. Especially the first few chapters will be good
    3 KB (435 words) - 13:23, 31 July 2011
  • Also, the paper ''[http://conal.net/papers/simply-reactive/ Simply Efficient Functional Rea Baker & Hewitt's 1977 paper ''[http://citeseer.ist.psu.edu/baker77incremental.html The Incremental Garb
    10 KB (1,586 words) - 10:40, 17 July 2011
  • ...]”. All my gratitude to Profesor Vasile Berinde for the acceptance of the paper, in the last minute.
    6 KB (942 words) - 19:26, 6 May 2010
  • * 2004 Paper [http://www.math.chalmers.se/~koen/pubs/entry-tt04-quickcheck.html QuickChe * 2003 Paper [http://www.math.chalmers.se/~koen/pubs/entry-fop-quickcheck.html Specifica
    8 KB (1,214 words) - 00:46, 23 October 2017
  • A paper specifically about point-free style: ...style underlies a lot of expert Haskeller's intuitions. A rather infamous paper (for all the cute symbols) is Erik Meijer et. al's:
    10 KB (1,782 words) - 14:44, 5 June 2011
  • ...by disabling parallel GC altogether (+RTS -g1), but as the results in our paper show, sometimes the parallel GC is essential for retaining locality in para
    3 KB (397 words) - 15:29, 23 May 2009
  • ...entations is that they are not generally amenable to parallelisation. This paper states that experiments indicate that little parallelism can be extracted f : This paper implies (section 2.2.1) that lenient evaluation can handle circular data st
    4 KB (643 words) - 23:33, 5 April 2021
  • ...inria.fr/~jcretin/papers/fc-kind-poly.pdf Giving Haskell a promotion], the paper about it.
    2 KB (242 words) - 23:38, 24 July 2021
  • that the paper "Type classes: an exploration of the design space" was available
    5 KB (630 words) - 12:09, 13 January 2007
  • * [http://www.ioc.ee/~wolfgang/research/ppdp-2010-paper.pdf Generic Record Combinators with Static Type Checking] describes a recor ...ellDB|HaskellDB]] project. More precisely, the problem is described in the paper downloadable from
    6 KB (770 words) - 05:26, 10 December 2020
  • ...in Section 2.1. of [http://dreixel.net/research/pdf/gdmh.pdf the original paper describing the new generic deriving mechanism]. ...les (but make sure to check the [[#Changes from the paper|changes from the paper]]).
    16 KB (2,615 words) - 20:24, 19 October 2020
  • This epic 73-page paper (JFP style) brings together our work on type inference for type functions, ...ge is a discussion page for the paper. If you are kind enough to read this paper, please help us by jotting down any thoughts it triggers off. Things to th
    9 KB (1,527 words) - 09:11, 10 August 2022
  • <li>The seminal paper on DSELs</li>
    2 KB (316 words) - 14:12, 14 October 2021
  • * Paper [http://www.cs.chalmers.se/~koen/pubs/icfp00-quickcheck.ps QuickCheck: A Li * Paper [http://www.math.chalmers.se/~koen/pubs/entry-fop-quickcheck.html Specifica
    11 KB (553 words) - 07:45, 2 July 2013
  • * 2004 Paper [http://dl.acm.org/citation.cfm?doid=351240.351266 QuickCheck: Specificatio * 2003 Paper [http://www.cs.utexas.edu/~ragerdl/fmcad11/slides/tutorial-a.pdf Specificat
    8 KB (1,186 words) - 20:49, 28 May 2021
  • See also the 2008 paper [http://www.staff.city.ac.uk/~ross/papers/Applicative.html Applicative prog
    2 KB (365 words) - 18:50, 19 September 2017
  • HaskellDB was originally developed by Daan Leijen, and is described in the paper Domain Specific Embedded Compilers, Daan Leijen and Erik Meijer. 2nd USENIX ...4D927950052C15CA41?doi=10.1.1.26.6906&rep=rep1&type=pdf Original HaskellDB paper]
    8 KB (1,042 words) - 15:22, 31 August 2010
  • ...~karczma/arpap/ Jerzy Karczmarczuk]'s ''(wonderful, wonderful! gem of a)'' paper with the funny title [http://users.info.unicaen.fr/~karczma/arpap/lazypi.ps
    3 KB (453 words) - 19:45, 26 December 2012
  • ...More details can be found in [http://dreixel.net/research/pdf/ghp.pdf this paper].
    2 KB (289 words) - 16:02, 28 February 2014
  • ...bags. ([http://www.eecs.usma.edu/Personnel/okasaki/pubs.html#hw00 overview paper]).
    17 KB (2,508 words) - 07:09, 8 June 2023
  • * Amanda Clare has written a paper on various methods for twisting the evaluation order: http://users.aber.ac.
    2 KB (342 words) - 09:27, 9 June 2023
  • ...a present in that regard: in this example we unwrapped the outer wrapping paper to get to the present: an object of type <hask>IO ()</hask>, which lets us
    4 KB (737 words) - 13:16, 5 November 2012
  • * Note that in the original paper, Huet dealt with B-trees (ones where nodes have arbitrary numbers of branch ...exed data types] by Ralf Hinze, Johan Jeuring and Andres Löh, or a similar paper [http://www.staff.science.uu.nl/~jeuri101/homepage/Publications/ghpractice.
    10 KB (1,623 words) - 21:10, 26 June 2023
  • ...ort for Racket’s macro system, built using the techniques described in the paper [http://www.ccs.neu.edu/home/stchang/pubs/ckg-popl2017.pdf Type Systems as * [https://github.com/haskell-lisp/liskell Liskell] - From the ILC 2007 paper: "Liskell uses an extremely minimalistic parse tree and shifts syntactic cl
    5 KB (799 words) - 16:55, 23 March 2021
  • . Deadline for Full Paper Submission: March 31, 2011
    3 KB (368 words) - 06:49, 24 March 2011
  • For more info about <hask>unamb</hask> and its use, see the paper ''[http://conal.net/papers/push-pull-frp/ Push-pull functional reactive pro
    2 KB (356 words) - 21:36, 4 February 2014
  • In his paper [https://academic.oup.com/comjnl/article-pdf/31/3/243/1157325/310243.pdf No
    2 KB (341 words) - 09:18, 22 February 2022
  • ...nderstanding the article does not require knowledge of category theory—the paper is self-contained with regard to understanding catamorphisms, anamorphisms ...and folds for the purpose of generic programming. Supplements the bananas paper.
    9 KB (1,379 words) - 04:11, 14 February 2023
  • ...e are explained in Section 9 and specifically Appendix D of the full HList paper <http://homepages.cwi.nl/~ralf/HList/paper.pdf>
    10 KB (1,575 words) - 13:27, 14 January 2015
  • ...er and Simon Thompson [http://www.cs.kent.ac.uk/pubs/2005/2266/content.pdf paper] on porting the Haskell Refactoring tool, HaRe, to the GHC API.
    4 KB (548 words) - 05:13, 30 January 2016
  • ...Harris, Marlow, Peyton Jones, 2005 The original SMP runtime implementation paper
    4 KB (456 words) - 12:02, 9 May 2024
  • * Read the paper ''[http://conal.net/papers/simply-reactive/ Simply Efficient Functional Rea
    4 KB (524 words) - 10:39, 17 July 2011
  • ...ones (hereafter referred to as the "fast curry" paper). Please consult the paper for a detailed description of the semantic rules. ...s in the paper very closely, to the point that each evaluation rule in the paper corresponds to an equation in the interpreter (specifically: equations of t
    15 KB (2,396 words) - 07:19, 10 August 2022
  • The misunderstanding isn't helped by the this paper's references to OO subtyping: http://homepages.inf.ed.ac.uk/wadler/papers/c There's an excellent (i.e. quite readable) paper on mapping OO code to Haskell, although it's more from the point-of-view of
    10 KB (1,718 words) - 07:14, 10 August 2022
  • * Research paper explaining the algorithm: http://www.cs.rice.edu/Conferences/IPTPS02/109.pd
    5 KB (766 words) - 13:28, 17 December 2012
  • ...formulation of Functional Reactive Programming can be found in the ICFP 97 paper [http://conal.net/papers/icfp97/ Functional Reactive Animation] by Conal El From page 6 of [http://conal.net/papers/icfp97/icfp97.pdf the paper]:
    11 KB (1,615 words) - 05:58, 7 November 2022
  • A good example of this is due to [[User:RalfHinze]] in his paper, [http://www.informatik.uni-bonn.de/~ralf/publications/SearchTree.ps.gz A f
    5 KB (845 words) - 02:22, 4 January 2008
  • paper uses old GADT syntax. This paper is a must-read because it omitted from this article. For example, the paper outlines how to do binary compression
    14 KB (2,322 words) - 13:55, 24 November 2023
  • *[[Humor/How quick can you write a ISI paper with Haskell or without it ?]]
    5 KB (667 words) - 22:52, 1 May 2024
  • This isn't an academic paper, so we won't mention Graham Hutton's [https://www.cs.nott.ac.uk/~gmh/fold.p
    5 KB (891 words) - 14:21, 3 January 2018
  • #See Simon L. Peyton Jones and John Launchbury's paper [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.50.231&rep=rep1&
    3 KB (470 words) - 09:25, 12 June 2023
  • * (beelsebob) <nowiki>read Olaf's paper, he has evidence that speed problems in Haskell are usually because people
    5 KB (697 words) - 16:59, 10 March 2011
  • ...cles/2007/10/02/probability-monads-at-hac-07-ii Darcs repository and draft paper]. ...s and helper code for Rand, BRand, DDist, and BDDist from example code and paper.
    8 KB (1,163 words) - 13:06, 17 December 2012
  • 18:25:14 <ddarius> byorgey: This deceptively named paper is rather useful a bit later on: http://www.science.uva.nl/ga/publications/
    6 KB (1,055 words) - 19:38, 21 December 2011
  • ...ementation techniques, but much more carefully structured than in the Eros paper.
    3 KB (540 words) - 21:40, 3 May 2024
  • ...Available in Proceedings, pp 425-429) Here is a translated version of this paper. http://wiki.haskell.org/wikiupload/5/55/ARA2-paper-RO.pdf
    6 KB (889 words) - 22:57, 18 April 2021
  • ...ding service. You can read more about this application architecture in the paper [http://www.cse.unsw.edu.au/~dons/papers/SC05.html Dynamic Applications Fro
    4 KB (632 words) - 19:45, 22 February 2008
  • [http://www.haskell.org/wikiupload/1/15/Paper-v5.sxw Download .sxw ] After loading the .sxw in the Open Office, press the [http://www.haskell.org/wikiupload/7/7d/POPA_D.pdf Official PDF of the paper for <DOWNLOAD> ], having the following title:
    8 KB (1,244 words) - 18:03, 13 July 2011
  • ...ttp://dreixel.net/research/pdf/lgph.pdf Libraries for Generic Programming] paper.
    4 KB (598 words) - 02:44, 13 February 2021
  • ...a draft structure based on the "[[History_of_Haskell|History of Haskell]]" paper.
    3 KB (332 words) - 03:38, 14 August 2021
  • Paper sheets of standard sizes: an expected-value problem.
    9 KB (1,415 words) - 08:22, 23 February 2010
  • Please see the ICFP Eros [http://conal.net/papers/Eros paper] and [http://conal.net/papers/Eros/talk.pdf talk] for a description.
    6 KB (947 words) - 18:08, 16 February 2011
  • ...provides an implementation of the ''task layer'' described in the original paper and implemented in the remote package. There is much to do her also, and an ...://dl.acm.org/citation.cfm?id=1863514 Unified Semantics for Future Erlang] paper, but extends it with a notion of "reconnecting" (this is described in detai
    12 KB (1,725 words) - 07:44, 10 August 2022
  • ...[http://www.haskell.org/wikiupload/e/e4/ARA1-paper.pdf Download the draft paper .pdf format.] ...rea in format .pdf] aferenta [http://www.haskell.org/wikiupload/e/e4/ARA1-paper.pdf lucrarii (3) - Download the .pdf format here!]
    4 KB (651 words) - 12:55, 7 May 2011
  • ...ading, of course. See [http://web.cecs.pdx.edu/~mpj/pubs/fundeps.html the paper] by Mark P. Jones for further details.
    4 KB (706 words) - 22:41, 21 July 2021
  • A slightly less formal essay inspired by the paper above can be found in Um ensaio pouco menos formal inspirado pelo paper acima pode ser encontrado em
    10 KB (1,648 words) - 22:57, 4 November 2008
  • ...lid candidate sub-expressions, using the algorithm described in a previous paper[4]. In the screenshot in Figure 1 above, the right hand side of a let expre
    4 KB (633 words) - 06:14, 8 June 2023
  • paper if they obtain the literate Haskell source code for the paper.
    10 KB (1,524 words) - 22:20, 13 November 2022
  • Sadly this paper is a little hard to get hold of now so this page will explain the algorithm
    10 KB (1,498 words) - 19:31, 14 August 2006
  • ...e [http://www.cse.unsw.edu.au/~chak/papers/SPCS08.html TypeFamilies 2008] paper; but note that was written concurrently with Type Families development; and The 1997 paper explains
    14 KB (2,091 words) - 17:28, 4 February 2023
  • Note that the syntax for quasiquotation has changed since the paper was written: in GHC 7 one writes <hask>[expr|...|]</hask> instead of <hask> the Haskell Workshop paper). These functions, from the Language.Haskell.TH.Quote
    12 KB (1,695 words) - 15:27, 12 November 2019
  • ...r <tt>cabal install zeno</tt> to use it from home. You can find the latest paper on Zeno [http://pubs.doc.ic.ac.uk/zenoTwo/ here], though please note that Z
    8 KB (1,368 words) - 15:52, 22 February 2012
  • ...t.psu.edu/viewdoc/download?doi=10.1.1.587.5376&rep=rep1&type=pdf ICFP 2014 paper]. This is a feature that first appeared in GHC 7.8.1 and will likely evolve
    5 KB (887 words) - 06:53, 12 June 2023
  • ...ogramming is good ([http://www.md.chalmers.se/~rjmh/Papers/whyfp.html This paper is one famous attempt]), but perhaps a better question to focus on is "Why
    7 KB (1,226 words) - 00:35, 10 May 2008
  • The abovereferenced paper describes how to implemement a STG machine in assembly language (or C). Jav So, similarly to what is described in the STG paper, the ''c'' method is used to evaluate a thunk. This method may also do self
    23 KB (3,210 words) - 22:00, 15 December 2008
  • long_description=" MTL is a monad transformer library, inspired by the paper \"Functional
    6 KB (802 words) - 04:59, 12 July 2021
  • ...data parallelism in Haskell, including some examples, can be found in the paper [http://www.cse.unsw.edu.au/~chak/papers/papers.html#ndp-haskell Nepal – ...ithm for solving the ''N''-body problem as discussed in more detail in the paper [http://www.cse.unsw.edu.au/~chak/papers/PLKC08.html Harnessing the Multico
    21 KB (3,158 words) - 08:39, 10 August 2022
  • ...ttp://okmij.org/ftp/Haskell/Iteratee/describe.pdf Iteratees]" - FLOPS 2012 paper
    6 KB (927 words) - 12:02, 19 April 2024
  • ...e rules. ([http://www.cs.uu.nl/wiki/bin/view/Ehc/RulerProgrammingTypeRules Paper]) ...trial strength" pretty printing library in Haskell, based on John Hughes's paper "The Design of a Pretty-printing Library" (in Advanced Functional Programmi
    13 KB (1,947 words) - 14:44, 21 July 2023
  • ** which presupposes reading also paper on the [http://www.haskell.org/haskellDB/ original] page (see [http://www.h
    6 KB (884 words) - 16:00, 19 April 2021
  • ==. The paper describing the modular monadic compiler == ...Technical Report"]] from http://www.haskell.org/wikiupload/6/61/2011-MCOMP-paper.pdf.zip
    20 KB (2,558 words) - 22:39, 29 June 2021
  • ...c Prelude]]. See an [http://dafx04.na.infn.it/WebProc/Proc/P_201.pdf early paper] on the concepts. Highly experimental.
    6 KB (831 words) - 20:07, 5 December 2021
  • This paper describes practical programming with types parameterized by numbers: e.g., In this paper, we develop realizations of number-parameterized types in Haskell that inde
    74 KB (11,649 words) - 11:34, 9 August 2012
  • You can read the paper by Richard E. Korf named "Finding Optimal Solutions to Rubik's Cube Using P
    8 KB (1,020 words) - 01:02, 23 September 2018
  • In the inital version of this paper, the following sources for packages are used:
    9 KB (1,365 words) - 21:35, 2 March 2012

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)