Search results

• Lazy pattern match
  What does "lazy pattern match" mean and what is the meaning of the tilde in pattern matches?
  4 KB (680 words) - 14:51, 6 March 2013
• Lazy functors
  with [[lazy pattern matching]] or with strict pattern matching? With the first definitions with lazy matching the laws are violated:
  3 KB (500 words) - 14:59, 31 July 2011
• Lenny222/About Haskell
  | lazy | pattern matching
  586 bytes (72 words) - 21:57, 23 April 2021
• List traversal
  That's the proof that the implementation is lazy. == First attempt - quadratic runtime, not lazy ==
  6 KB (952 words) - 07:39, 7 September 2012
• Lazy vs. non-strict
  Haskell is often described as a lazy language. ...ntics|non-strict]], which is not quite the same thing as [[lazy evaluation|lazy]].
  4 KB (643 words) - 23:33, 5 April 2021
• Exact real arithmetic
  ...l, mainly because of its purity, lazyness, presence of lazy lists, pattern matching. Martín Escardó has many exact real arithetic materials also among his ma ...ble Technique in the World to compute pi] describes how to compute Pi as a lazy list of digits.
  3 KB (453 words) - 19:45, 26 December 2012
• Performance/Laziness
  ...only evaluated when needed, and <code>(:)</code>, a.k.a. ''"cons"'', is a lazy data constructor. The machinery used to implement this is called a thunk. I ...they consume only enough value to produce the value. As an example of how lazy functions work, consider:
  8 KB (1,287 words) - 06:52, 20 April 2012
• Newtype
  ...inct from <hask>Any ⊥ :: Any</hask>. What this means is that the following pattern match: must evaluate its argument, even though it seems like the pattern match can't fail: we must check whether <hask>x</hask> is <hask>⊥</hask>
  6 KB (1,007 words) - 15:57, 22 May 2016
• Video presentations/Haskell Symposium 2008
  ;[http://video.google.com/videoplay?docid=8540922190337591178 SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values] ...rns, But Enough - an automatic verifier for partial but sufficient pattern matching]
  4 KB (463 words) - 22:58, 7 December 2008
• Haskell Lisp
  ...attern-matching against non-free data types, directly representing pattern-matching against a wide range of data types such as lists, multisets, sets, trees an ...hat offers pattern matching, lambda calculus consistency, macros, optional lazy evaluation, static type checking, one of the most powerful systems for typi
  5 KB (799 words) - 16:55, 23 March 2021
• How to read Haskell
  === Tip: Haskellers love pattern matching === === Tip: pattern matching and guards can be mixed and matched ===
  15 KB (2,547 words) - 21:58, 29 October 2011
• Blog articles/Comparisons
  ...//enfranchisedmind.com/blog/archive/2007/07/10/279 The "ole in the middle "pattern] * [http://www.aboutcode.net/2007/09/27/Lazy+Functions+In+LINQ.aspx Lazy functions in C#]
  13 KB (1,443 words) - 23:42, 13 October 2019
• New monads
  ...onsume values from a (finite or infinite) supply. Note that due to pattern matching, running out of supply in a non-MonadZero monad will cause an error. == Lazy and Strict variants ==
  4 KB (648 words) - 09:43, 9 December 2014
• Maintaining laziness
  ...ell's main features is [[non-strict semantics]], which is implemented by [[lazy evaluation]] in all popular Haskell compilers. In this article we want to go through some techniques on how to check lazy behaviour on functions, examples of typical constructs which break laziness
  20 KB (3,325 words) - 12:02, 19 April 2024
• Stack overflow
  pattern matching stack whose entries are essentially case ...you are getting stack overflows. However, making code tail-recursive in a lazy language is not quite the same as in a eager language. This page is more ge
  10 KB (1,678 words) - 20:41, 16 January 2012
• Performance
  ...ages and vice versa, due to strong typing, automatic memory management and lazy evaluation. ...the rest of this resource first by Haskell construct (data types, pattern matching, integers), and then within each category to describe techniques that apply
  10 KB (1,392 words) - 21:39, 26 August 2018
• Research papers/Testing and correctness
  ...Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs] ;[ftp://ftp.ida.liu.se/pub/labs/pelab/papers/aadebug93ladb.ps.gz Lazy algorithmic debugging: ideas for practical implementation.]
  11 KB (1,480 words) - 16:36, 1 August 2021
• The Monad.Reader/Issue5/Different Language
  Haskell is a [[lazy]] language. It never performs a computation unless it needs to. This is not In Haskell, a string is a list of characters. Because Haskell is lazy, elements of a list are only evaluated when their contents are required for
  19 KB (3,237 words) - 01:33, 10 May 2008
• Keywords
  to illustrate the difference between strict versus lazy constructor * In [[pattern guard]]s, "matches":
  22 KB (3,350 words) - 04:31, 8 June 2023
• Haskell a la carte
  ...compiler will automatically infer (= figure out) one for you if you're too lazy to write down a type signature yourself. Of course, parenthesis are allowed ::Exponentiation again, this time with ''pattern matching''. The first equation that matches will be chosen.
  6 KB (1,024 words) - 23:56, 25 June 2021

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