Search results

• Regular expressions
  ! Lazy? ...rt String, (Seq Char), ByteString, and (except for regex-posix) ByteString.Lazy.
  18 KB (2,819 words) - 19:20, 15 August 2019
• Debugging
  You must keep in mind that due to lazy evaluation your traces will only print if the value they wrap is ever deman ...ell.org/~ndm/safe/ the safe library]. If you get an error message such as "pattern match failure, head []", you can then use <tt>headNote "extra information"<
  9 KB (1,453 words) - 19:18, 3 February 2021
• A brief introduction to Haskell
  * Is a lazy, purely functional language (that also has imperative features such as side * [[Lazy evaluation]]: results are only computed if they're required (strictness opt
  41 KB (6,592 words) - 22:27, 3 May 2024
• HsLua
  metaprogramming, persistency, functional programming, lazy evaluation, pattern matching, terse syntax for anonymous lambdas, list
  13 KB (2,016 words) - 18:34, 20 August 2017
• The Monad.Reader/Issue3/Notes on Learning Haskell
  One way of seeing this might be to consider Haskell as a pattern language: I think many, if not most, design patterns commonly found in design pattern catalogs
  31 KB (5,175 words) - 04:59, 9 March 2011
• Performance/GHC
  ...psu.edu/viewdoc/download?doi=10.1.1.53.3729&rep=rep1&type=pdf Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine], S '''!''' for '''`seq`''' is reminiscent of the new bang-pattern proposal for
  25 KB (3,873 words) - 11:08, 6 March 2023
• Why Haskell matters
  ...solution you can simply extract the first element of the resulting list - lazy evaluation will make sure that nothing is needlessly computed. ...see that we have two definitions of the functions. This is called pattern matching and we can briefly say that it will test the argument passed to the functio
  33 KB (5,616 words) - 22:30, 3 May 2024
• Shootout/Regex DNA
  * use the same simple regex pattern match-replace to remove FASTA sequence descriptions and all wildcard in one position), and (one pattern at a time) count matches in the redirected file
  133 KB (20,540 words) - 08:31, 13 December 2009
• Research papers/Type systems
  ...tp://citeseer.ist.psu.edu/launchbury93natural.html A Natural Semantics for Lazy Evaluation] ...c.uk/oucl/work/jeremy.gibbons/publications/typecase.pdf TypeCase: a design pattern for type-indexed functions]
  26 KB (3,569 words) - 10:04, 1 September 2022
• Introduction
  ...ymorphism|polymorphically]] [[typing|statically typed]], [[Lazy evaluation|lazy]], [[functional programming|purely functional]] '' language, ...empty list on its left-hand side, and the second, with <code>(p:xs)</code> pattern on its left-hand side standing for non-empty list with the head element <co
  26 KB (4,102 words) - 23:54, 29 February 2020
• Introduction to Haskell IO
  ### do has some other "goodies" like pattern matching and "lets" lets desugar to the obvious thing. ...he real world! in reality IO enforces ordering, which lets haskell do its lazy evaluation. It doesnt really represent "the real world" internally some ho
  10 KB (1,520 words) - 07:20, 10 November 2020
• Tying the Knot
  ...he first few times you do it, but it works fine - remember, Haskell is a ''lazy'' language. This means that while you are building the node, you can set th ...l/Knuth-Morris-Pratt-in-Haskell Knuth-Morris-Pratt algorithm for substring matching]
  24 KB (3,850 words) - 17:16, 28 June 2021
• Applications and libraries/Operating system
  ...ibrary, based on runProcess in the standardised posix library. It provides lazy output from subprocesses. ...library for working with files and directories. Includes code for pattern matching, finding files, modifying file contents, and more.
  11 KB (1,663 words) - 19:17, 15 August 2019
• Syntactic sugar/Cons
  they lack lazy evaluation, Guards are extended to [[pattern guard]]s and
  16 KB (2,610 words) - 17:17, 4 February 2023
• Yhc/TMR
  "Sample: Pattern match failure in function at 9:1-9:15." match it against each pattern in turn, and finally reduce the body of
  28 KB (4,378 words) - 13:10, 8 April 2007
• Haskell Tutorial for C Programmers
  ===Part V: Making Sense of 'fibs', and Why Lazy Evaluation is Important=== ...why does the list only get evaluated as far as you print it? Haskell is 'lazy', meaning that it doesn't do work that it doesn't have to. C programmers k
  111 KB (19,450 words) - 17:55, 23 October 2019
• News/2007
  <li><p><em>Lazy SmallCheck 0.1</em>. Matthew Naylor ...[http://article.gmane.org/gmane.comp.lang.haskell.general/15702 announced] Lazy SmallCheck 0.1, a library for exhaustive, demand-driven testing of Haskell
  78 KB (11,405 words) - 03:19, 11 February 2008
• FAQ
  Use pattern-matching. If <hask>mx :: Maybe Int</hask>: If you pattern-match without a <hask>Nothing</hask> case:
  36 KB (5,813 words) - 06:04, 13 April 2024
• All About Monads
  ...onadic type <code>m a</code>. The expression to the left of the arrow is a pattern to be matched against the value ''inside'' the monad. <code>(x:xs)</code> w ...o standard monadic operators is roughly that every expression matched to a pattern, <code>x <- expr1</code>, becomes
  169 KB (26,630 words) - 00:15, 19 September 2021
• News/2006
  ...easy to use operation; full support of text and binary transfers; optional lazy interaction; server can serve up a real or a virtual filesystem tree; Stand ...blem with pattern match errors, and the only helpful message they get is: 'pattern match error'. The Safe library hopes to eliminate some of the frustration t
  93 KB (13,836 words) - 23:40, 14 August 2019

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