Search results

Create the page "David T" on this wiki! See also the search results found.

• Applications and libraries/Mathematics
  ...c.uk/arch/dlester/exact.html ERA] is an implementation (in Haskell 1.2) by David Lester. ...e operations on Integers which will be implemented in GHC. The library isn't available yet.
  20 KB (2,795 words) - 13:15, 11 December 2019
• Introduction
  After all, if you don't know exactly when an assignment will happen, you can't make much use of it! This contrasts strongly
  26 KB (4,102 words) - 23:54, 29 February 2020
• Hoogle
  There's a problem in that hoogle doesn't look for hoogle.txt in the system <code>$PATH</code>, it only looks in the The work is intended to be helpful, open and free. If the license doesn't meet your needs then talk to me.
  18 KB (2,779 words) - 22:27, 12 June 2017
• Haskell in practice
  <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
• Books
  This book doesn't introduce you to the Haskell language, but instead, it tells about high-lev <dt>Simon Peyton Jones, David Lester: [http://www.amazon.com/Implementing-Functional-Languages-Prentice-H
  50 KB (7,257 words) - 18:58, 3 March 2023
• QuotesPage
  Oh like that's going to work. You'd be better off selling T-shirts that algorithm) "DON'T YOU UNDERSTAND?".
  55 KB (8,884 words) - 01:18, 10 November 2022
• Old news
  <li><p><em>HAppS-Server 0.9.2</em>. Uploaded by David Himmelstrup. <li><p><em>HAppS-State 0.9.2</em>. Uploaded by David Himmelstrup.
  76 KB (9,269 words) - 19:17, 15 August 2019
• Haskell in education
  cursory search on the web didn't reveal many courses <b>Instructor:</b> [mailto:dave@cs.chalmers.se David Sands]
  40 KB (6,259 words) - 05:49, 6 June 2020
• Links
  ...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/peop ...ig/ Meurig Sage], University of Glasgow, [http://www.cs.chalmers.se/~dave/ David Sands], Chalmers University of Technology, [http://www.dcs.gla.ac.uk/~sanso
  11 KB (1,759 words) - 09:41, 10 August 2022
• Generalised algebraic datatype
  ...being Haskell, we have a pretty convincing argument that the evaluator won't mangle our types. We say that typing is preserved under evaluation (preserv Couldn't match `Empty' against `NonEmpty'
  8 KB (1,374 words) - 14:33, 15 December 2022
• Sudoku
  By AlsonKemp. This solver is probably similar to Cale's but I don't grok the non-deterministic monad... data ATree a = ANode T [[ATree a]]
  67 KB (9,593 words) - 05:40, 9 March 2021
• Research papers/Runtime systems
  :Colin Runciman and David Wakeling. York University. YCS-92-172. 1992. :Andre Pang, Don Stewart, Sean Seefried, and Manuel M. T. Chakravarty. In Proceedings of the ACM SIGPLAN Workshop on Haskell, pages
  9 KB (1,252 words) - 05:28, 1 September 2022
• Research papers/Data structures
  :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 Jones,
  14 KB (1,953 words) - 00:54, 5 June 2022
• Research papers/Domain specific languages
  :T Sheard, E Pasalic - Proceedings of the 2nd conference on Domain-specific la :Koen Claessen and David Sands. ASIAN '99. 1999.
  9 KB (1,309 words) - 07:48, 18 September 2014
• Darcs
  *<tt>darcs obliterate</tt>: remove a patch. ''Warning: if the patch doesn't exist elsewhere, you will lose that work.'' ...for [[generalised algebraic datatype]]s. The motivations are described in David Roundy's slides [http://darcs.net/fosdem_talk/talk.pdf Implementing the dar
  4 KB (654 words) - 15:20, 6 February 2021
• Continuation
  ...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,545 words) - 02:05, 8 October 2022
• Research papers/Authors
  *[https://scholar.google.com/citations?user=w6XYY_EAAAAJ Manuel M. T. Chakravarty] *[http://www.ipl.t.u-tokyo.ac.jp/~hu/pub/tech.html Zhenjiang Hu]
  8 KB (1,251 words) - 05:43, 1 September 2022
• HaWiki migration
  * David Himmelstrup (Lemmih) === P to T ===
  21 KB (2,417 words) - 23:19, 9 August 2021
• Shootout/Fannkuch
  * Repeat this until the first element is a 1, so flipping won't change anything more: {3,4,2,1,5}, {2,4,3,1,5}, {4,2,3,1,5}, {1,3,2,4,5}. by David Place. Compile with -O2 -optc-O3.
  22 KB (3,539 words) - 00:49, 14 December 2016
• Shootout/SumFile
  ''Those guys tell us these benchmarks don't favor C and then impose a limit on line length? What's the purpose of that Just (k,t) -> go (n+k) (S.tail t)
  20 KB (3,239 words) - 02:07, 26 April 2021

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