Search results

Jump to navigation Jump to search
  • ...tom:1px solid #eee">Lotto: Draw N different random numbers from the set 1..M. <span style="float:right"><small>[[99 questions/Solutions/24|Solutions]]</ * (group3 '(aldo beat carla david evi flip gary hugo ida))
    6 KB (890 words) - 05:51, 10 June 2023
  • * David Luposchainsky (TNG Technology Consulting, dluposchainsky(λ)googlesemail, a * M Farkas-Dyck
    1 KB (158 words) - 00:18, 17 June 2021
  • *[https://scholar.google.com/citations?user=w6XYY_EAAAAJ Manuel M. T. Chakravarty] ==M==
    8 KB (1,251 words) - 05:43, 1 September 2022
  • poly m = [(n, x) | (n, x) <- zip [1..] $ takeWhile (<10000) $ scanl (+) 1 [m-1,2*m-3..],
    6 KB (979 words) - 10:20, 18 May 2022
  • ...instruction but a ''dynamic'' one (David Madore's [http://www.madore.org/~david/computers/callcc.html#sec_intro A page about <code>call/cc</code>]) ...ode>call/cc</code>] describes the concept, and his [http://www.madore.org/~david/programs/unlambda/ The Unlambda Programming Language] page shows how he imp
    10 KB (1,560 words) - 12:02, 15 April 2024
  • ...r explaining the theoretical roots of quines (e.g. [http://www.madore.org/~david/computers/quine.html#sec_fp fixed point theorem]) ...achieve something similar to currying, see [http://en.wikipedia.org/wiki/S-m-n_theorem Kleene's <math>s^m_n</math> theorem]). So using <math>f:A\times B
    13 KB (2,068 words) - 23:19, 3 June 2019
  • * [mailto:capn.freako@gmail.com David Banas] - amateur Haskeller ...on breakdown visualization project hosted by [mailto:capn.freako@gmail.com David Banas]
    6 KB (923 words) - 17:52, 13 June 2014
  • .../Hiw2012-jose-pedro-magalhaes.pdf Slides], [http://www.youtube.com/watch?v=m-ZU6rwm3Ow Video] * [http://www.cse.unsw.edu.au/~chak/ Manuel M T Chakravarty] (University of New South Wales)
    6 KB (790 words) - 03:05, 25 July 2021
  • <dt>[[Darcs]][http://abridgegame.org/darcs/]<dd>David's Advanced Revision Control System is yet another replacement for CVS. It i ...ris.ac.uk/~tweed/haskprog.html David Tweeds Haskell Programs]<DD>Currently David offers a LaTeX preprocessor.
    14 KB (2,263 words) - 06:31, 10 August 2022
  • My project was refactoring programs with hlint suggestions. I'm Johan Tibell writes: I'm very happy with Adam's work strict Haskell. StrictData is already in HEAD a
    8 KB (1,152 words) - 13:09, 24 March 2018
  • :Philip Johnson-Freyd, Paul Downen and Zena M. Ariola; Olivier Danvy & Ugo de’Liguoro (Eds.): WoC’15 Post-proceedings :Colin Runciman and David Wakeling. York University. YCS-92-172. 1992.
    9 KB (1,252 words) - 05:28, 1 September 2022
  • ...hsce/ Category extras], by [http://www.eyrie.org/~zednenem/about/dave.html David Menendez]: libraries for e.g. functors, bifunctors, comonads, natural trans * Brendan Fong, David I Spivak: [https://arxiv.org/abs/1803.05316 Seven Sketches in Compositional
    9 KB (1,379 words) - 04:11, 14 February 2023
  • ...u/~magnus/ Magnus Carlsson], OGI,[http://www.cse.unsw.edu.au/~chak/ Manuel M. T. Chakravarty], University of New South Wales,[http://www.cs.kent.ac.uk/p *<b>M:</b>[http://www.research.microsoft.com/~simonmar/ Simon Marlow], Microsoft,
    11 KB (1,759 words) - 09:41, 10 August 2022
  • :Jeremy Gibbons, David Lester, and Richard Bird. Journal of Functional Programming, 16(3):281-292 :Manuel M. T. Chakravarty and Gabriele Keller. In Johan Jeuring and Simon Peyton Jone
    14 KB (1,953 words) - 00:54, 5 June 2022
  • | 5pm || || ''David Luposchainsky'', '''Low-level Haskell: an interactive tour through the STG' In this talk, I'm going to introduce "generics-sop", a library that
    13 KB (1,982 words) - 10:32, 8 September 2016
  • * David Wagner I plan to fix a few random GHC bugs and I’m more than happy to guide GHC-newbies in doing the same. Planning and coordi
    10 KB (1,601 words) - 10:27, 27 October 2014
  • :M Wallace, C Runciman - ACM SIGPLAN Notices, 1999 :Kooijman, M. (2009); master's thesis.
    9 KB (1,309 words) - 07:48, 18 September 2014
  • Performance is summarised (on OpenBSD/x86 1.6Ghz Pentium M): by David Place. Compile with -O2 -optc-O3.
    22 KB (3,539 words) - 00:49, 14 December 2016
  • ...arl: The Great Escape: Or how to jump the border without getting caught] - David Herman. ...ns/publications/rationals.pdf Enumerating the rationals] - Jeremy Gibbons, David Lester and Richard Bird.
    20 KB (2,961 words) - 16:50, 6 February 2024
  • ; [[/David Beckingsale's xmonad.hs]] (0.9) ;[[/David Roundy's xmonad.hs]] (0.8 +)
    29 KB (4,125 words) - 12:46, 15 January 2021
  • ...(&forall; ''m'' &isin; '''N'''<sub>2</sub>) (&#8202;(''m'' | ''n'') &rArr; m = n)&#8202;} ...&isin; '''N'''<sub>2</sub>) (&#8202;''m''&#8202; &lt; ''n'' &rArr; &not;(''m'' | ''n''))&#8202;}
    58 KB (8,594 words) - 20:34, 6 May 2023
  • I'm planning assignments using Fran and Active Haskell and <b>Instructor:</b> [mailto:dave@cs.chalmers.se David Sands]
    40 KB (6,259 words) - 05:49, 6 June 2020
  • ...ughes], The Computer Journal, Vol. 32, No. 2, 1989, pp. 98 - 107. Also in: David A. Turner (ed.): Research Topics in Functional Programming, Addison-Wesley, :Colin Runciman and David Wakeling (ed.), UCL Press, 1995, ISBN 1-85728-377-5 HB. From the cover:<blo
    35 KB (5,188 words) - 09:24, 17 April 2024
  • ...t Says what it Means]] ([https://wiki.haskell.org/wikiupload/4/4c/Hiw-2015-david-christiansen.pdf slides]) ([https://youtu.be/m7BBCcIDXSg video]) Lastly, as a new PhD student, I'm going to ask audience for feedback, further ideas and collaborators for Has
    15 KB (2,190 words) - 21:19, 17 February 2016
  • ...8 + Heirarchical Modules, I do not wish to change this. Other than that, I'm pretty flexible about most aspects of Hoogle. The [http://code.google.com/p * David Waern
    18 KB (2,779 words) - 22:27, 12 June 2017
  • <shapr> I'm addicted to arrows. ...and when someone complains that it doesn't work on their toaster because I'm a moron who can't write portable code, I can say, smiling, "patches welcome
    55 KB (8,884 words) - 01:18, 10 November 2022
  • ...e value <code>x</code> while producing some I/O effects, then <code>fmap g m</code> will compute the value <code>g x</code> while producing the same I/O class Applicative m => Monad m where
    179 KB (29,519 words) - 16:10, 30 December 2022
  • :Philip Wadler. In M. Broy, editor, Marktoberdorf Summer School on Program Design Calculi, Sprin :David King and Philip Wadler. Glasgow Workshop on Functional Programming, Springe
    18 KB (2,331 words) - 09:02, 1 September 2022
  • newtype NondetT m a = NondetT { foldNondetT :: (forall b. (a -> m b -> m b) -> m b -> m b) }
    67 KB (9,593 words) - 05:40, 9 March 2021
  • ...cussion.pdf Functional Programs as Executable Specifications: Discussion], David A. Turner (page 17 of 27).</small><!-- 1984 --> ...&type=pdf Realising nondeterministic I/O in the Glasgow Haskell Compiler], David Sabel (page 37 of 39).</small><!-- 2003 -->
    61 KB (9,234 words) - 04:14, 5 April 2024
  • <dt>Simon Peyton Jones, David Lester: [http://www.amazon.com/Implementing-Functional-Languages-Prentice-H en distintas titulaciones de la Universidad de Málaga. Aún así, su
    53 KB (7,703 words) - 13:28, 28 March 2024