Search results

• Prime numbers
  ...(∀ ''m'' ∈ '''N'''₂) ( (''m'' | ''n'') ⇒ m = n) } ...∈ '''N'''₂) ( ''m''  < ''n'' ⇒ ¬(''m'' | ''n'')) }
  58 KB (8,594 words) - 20:34, 6 May 2023
• Haskell in education
  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
• HaskellImplementorsWorkshop/2015
  ...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
• Tutorials
  ...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
  31 KB (4,662 words) - 08:38, 20 April 2024
• Hoogle
  ...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
• QuotesPage
  <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
• Typeclassopedia
  ...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
• Research papers/Monads and arrows
  :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
• Sudoku
  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
• The I/O problem
  ...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
• Books
  <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

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