Search results

• Stackage
  Stackage is an infrastructure to create stable builds of complete package sets (hencefo One of the easiest ways to get started with Stackage is to [http://www.stackage.org/alias/fpcomplete/unstable-ghc78-exclusive/cabal
  1 KB (172 words) - 09:01, 24 February 2017
• Discus
  The Discus language is an experimental dialect of Haskell which investigates static typing and pro ...ither a pure/functional or effecful/imperative style, and one of our goals is to provide both styles coherently in the same language. The two styles can
  812 bytes (123 words) - 00:48, 24 February 2018
• ZuriHac2015/Projects/Gipeda
  Gipeda is a dashboard to display performance data. Basically a converter from (Git re ...mind, and you can see it in action at http://perf.haskell.org/ghc. But it is kept generic and you are free to use it for your own projects as well.
  1 KB (201 words) - 08:12, 22 May 2015
• Scoped type variables
  ida :: b -> b -- Legal, because b is now a free variable ...ssible to specify the particular type of a function in situations where it is not otherwise possible, which can in turn help avoid problems with the [[Mo
  3 KB (435 words) - 22:56, 12 June 2021
• Hoare Property
  The Hoare Property is a code metric based upon a quote by [http://en.wikipedia.org/wiki/Tony_Hoar Code adhering to the former is said to have the Hoare property, code adhering to the latter could be consi
  431 bytes (80 words) - 01:34, 17 June 2021
• 99 questions/Solutions/14
  and here is the proof that <hask>((.) <$> (:) <*> (:)) = (\y z -> y:y:z)</hask>: ((.) <$> (:)) <*> (:) = -- (<$>) is infixl 4, (<*>) is infixl 4
  2 KB (220 words) - 20:45, 28 December 2014
• Mlist
  MList is a monadic-list, aiming to be an alternative to [[Lazy IO|lazy I/O]]. MList is parameterized on a monadic type, such that folding the list executes action
  427 bytes (73 words) - 12:02, 19 April 2024
• QuickCheck
  QuickCheck is a library for random testing of program properties. The latest version is under version control
  818 bytes (104 words) - 18:28, 16 January 2017
• 99 questions/Solutions/92
  ...he difference of its node numbers equals to K. The conjecture is that this is always possible. ...ult to find a solution. And remember, we don't know for sure whether there is always a solution!
  3 KB (420 words) - 22:52, 7 June 2017
• OCaml
  '''OCaml''' is a functional programming language in the ML family, an extension of the Cam OCaml is strict by default, although it has some facility for introducing laziness.
  2 KB (293 words) - 16:34, 15 May 2023
• Switching type classes at runtime
  It is possible to create a type class instance at runtime by coercing a value to -- This is used internally in 'rethrowUnchecked' to avoid impredicative
  1 KB (215 words) - 10:06, 3 August 2015
• Haskell/Lazy evaluation
  Analyzing this code a little, we can see that <code>(magic 1 1)</code> is just the Fibonacci numbers, namely <code>[1,1,2,3,5,...]</code>, i.e. an in ...ly evaluated, how can the full function call ever be evaluated? The answer is: Lazy Evaluation. In this tutorial, we're going to step through this code,
  4 KB (708 words) - 23:10, 19 April 2021
• Type variables instead of concrete types
  But the signature is not as expressive as it could be. We realize that <hask>maximum</hask> is not about numbers, but can also be used for other ordered types, like <hask
  3 KB (531 words) - 15:19, 6 February 2021
• Wadler's Law
  a feature in this list is proportional to two raised to about half saying that > is wonderful, and half saying it is awful.
  4 KB (583 words) - 10:26, 26 December 2017
• Hac φ/Attendees
  This is a partial list of attendees for [[Hac φ]]. Please refer to the [[Hac φ|ma Feel free to list yourself here -- though this is ''not'' registration. You can register [https://goo.gl/forms/510yxJ4KOHR8QK
  1 KB (190 words) - 14:59, 21 October 2016
• Haddock/Development ideas
  ...functions like <hask>(.)</hask> and <hask>mapM</hask> where the definition is the clearest possible documentation. ...uld be an option to include a simplified implementation of a function that is equivalent to the one in the code. For instance, instead of showing a compl
  1 KB (212 words) - 19:11, 14 March 2014
• Monad Transformers
  ...de> is the top-most transformer in a monad transformer stack. This package is Haskell 98 and thus can be also used with [[JHC]]. ...rough a type class abstraction like <code>MonadState</code>. This version is now obsolete.
  4 KB (589 words) - 19:37, 17 June 2018
• Let vs. Where
  ...aste in the sense of "[[Declaration vs. expression style]]", however there is more to it. ...written wherever expressions are allowed. In contrast, <hask>where</hask> is bound to a surrounding syntactic construct, like the [[pattern matching]] l
  4 KB (716 words) - 07:41, 26 January 2019
• Web/Framework Interfaces
  Hack is a simple interface for applications. Based on Ruby's Rack, it presents a ve ...ttpVersion, as opposed to simply using Strings or ByteStrings. Performance is achieved by using an enumerator interface, allowing constant-space response
  2 KB (217 words) - 12:02, 19 April 2024
• Functor hierarchy proposal
  ...not a superclass of <hask>Monad</hask>, even though logically every monad is a functor. New classes have been added to HEAD to create a richer hierarchy The downside of this is that every instance declaration of <tt>Monad</tt> would have to be accompan
  2 KB (294 words) - 05:14, 8 June 2023

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