Search results

• HaskellImplementorsWorkshop/2016
  ...of type 'IO a'. This idea has been described previously, by both Filinski [1] who named the operators 'reflect' and 'reify', as well as Pfenning and Dav [1] Representing Monads Andrzej Filinski Principles of Programming Languages,
  16 KB (2,520 words) - 06:08, 16 October 2016
• Prime numbers
  ...ber'' (or a ''prime'') is such that has no divisors other than itself (and 1). This means that it cannot be represented as a product of any two of such ...', i.e. those representable as product of two natural numbers greater than 1.
  58 KB (8,594 words) - 20:34, 6 May 2023
• The Monad.Reader/Issue2/FunWithLinearImplicitParameters
  reset (1 + shift (\k -> k 1 + k 2)) :: Int ...k> is <hask>k = \x -> x + 1</hask>, so the expression evaluates to <hask>k 1 + k 2 = 2 + 3 = 5</hask>.
  35 KB (5,673 words) - 20:05, 7 July 2015
• CTRex
  We also provide a constraint to test that two Rows are '''disjoint'''. Corresponding to this we also provide a f <haskell> typerr1 = (x := 1 .| empty) .! y + 1 </haskell>
  25 KB (4,073 words) - 08:53, 9 December 2013
• Glome tutorial
  ...iew" as well, but to use Glome for anything other than viewing the default test scene, you may want to download the source tar file manually. ...verything works, a window should open and you should (after a pause) see a test scene with a variety of geometric shapes. If it doesn't work, then let [ht
  40 KB (6,787 words) - 01:19, 8 April 2014
• POV-Ray SDL project
  light_source {<-2, +3, -5>, colour rgb 1} pigment {colour rgb <1, 0, 0>}
  9 KB (1,391 words) - 15:17, 6 February 2021
• Library/Streams
  h <- openRawFD "test" WriteMode transformer. If you don't use any encodings other than Latin-1 -- or
  21 KB (3,181 words) - 16:03, 14 March 2014
• HXT
  ...onent is a validating and namespace-aware XML Parser that supports the XML 1.0 Standard almost completely. Extensions are a validator for RelaxNG and an <p></p>This definition corresponds 1:1 to the composition of binary relations. With the help of the <hask>(>>>)</h
  48 KB (6,937 words) - 00:20, 27 April 2016
• HacFreiburg2017
  ...Talk by <u>David Luposchainsky: "Haskell QA“</u>: Live Session explaining test frameworks and setup, benchmarking, generating and validating documentation ...t bus between the airport and Freiburg train station. Travel time is about 1 hour, a one-way ticket costs about 20 € (credit cards not accepted). The
  7 KB (1,040 words) - 11:33, 4 August 2017
• BerkeleyDBXML
  To test your installation, see if you can run the 'dbxml' command from the install Trying 127.0.0.1...
  15 KB (2,390 words) - 15:19, 6 February 2021
• Regular expressions
  {| border="1" cellspacing="0" cellpadding="5" | easier for newcomers from other languages; 0.5.1 leaks memory in some cases
  18 KB (2,819 words) - 19:20, 15 August 2019
• Why Haskell matters
  ...what this line says is just "To get the result, filter the list xs by the test p and compute the length of the result". ...rgument. Notice that filter is also a higher order function, it takes the "test function" as an argument.
  33 KB (5,616 words) - 22:30, 3 May 2024
• Simonpj/Talk:OutsideIn
  ...ocal assumptions: [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.167.4165&rep=rep1&type=pdf PDF]''' '''Version 1 comments, now dealt with; thank you!'''
  9 KB (1,527 words) - 09:11, 10 August 2022
• Haskore
  Step 1. Install the remaining packages such that at the end the following packages ....haskell.org/haskore/revised/ Design experiments] || Henning Thielemann || Test of several changes of Haskore's design targetting at more flexibility and c
  8 KB (1,173 words) - 10:09, 14 July 2014
• Haskellへのヒッチハイカーガイド
  73 KB (10,050 words) - 00:05, 19 April 2021
• Template Haskell
  ...sign can be found [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf here]. It is [https://downloads.haskell.org/ghc ...size. Taken from [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf this paper].
  30 KB (4,551 words) - 00:29, 15 June 2023
• Sudoku
  solve = forM [(i,j) | i <- [1..9], j <- [1..9]] $ \(i,j) -> do a <- option [1..9] -- pick a number
  67 KB (9,593 words) - 05:40, 9 March 2021
• Meet Bob The Monadic Lover
  > oneMoreTime (Lover (name,times)) = Lover (name,times + 1) Lover {loverDiary = ("Antonia ",1)}
  28 KB (4,668 words) - 15:16, 6 February 2021
• Hitchhikers guide to Haskell
  == Chapter 1: Ubiquitous "Hello world!" and other ways to do IO in Haskell == -- Taken from 'cd-fit-1-1.hs'
  69 KB (11,026 words) - 12:26, 9 January 2023
• Humor/Wanda
  -- Carl Sagan, "The Fine Art of Baloney Detection," Parade, February 1, 1987 "wisdom engineering". As a test of our ideas, we have written IMMANUEL, a
  8 KB (1,343 words) - 09:02, 13 March 2016

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