Search results

• 99 questions/Solutions/49
  An n-bit Gray code is a sequence of n-bit strings constructed according to certain rules. Find ou % gray(N,C) :- C is the N-bit Gray code
  2 KB (298 words) - 03:02, 7 June 2021
• Orphan instance
  ...neither defined in the module where C is defined nor in the module where T is defined. ...to ensure that they are never imported together in a module somewhere. It is almost impossible to assert that, or put differently, it would reduce the c
  3 KB (489 words) - 10:13, 31 May 2015
• Haskell Communities and Activities Report
  ...the Haskell community as a whole, to be updated twice a year. The purpose is twofold: To this end, there is a half-yearly informal survey of the main Haskell mailing list, inviting ev
  13 KB (1,772 words) - 12:21, 27 September 2022
• Web/Libraries/Templating
  ...e templates. It uses Haskell's quasi-quoting facilities so that everything is checked at compile time. Unlike using an HTML combinator library, it uses a ...ported by Sterling Clover. It can be used for any templating purpose, but is often used for dynamically generated web pages.
  1 KB (193 words) - 04:57, 26 April 2021
• Generics
  ...frequently just called ''generic programming'' or ''generics'' in Haskell, is a form of abstraction that allows defining functions that can operate on a ...nd the polymorphism is not present in compiled code. So the word "generic" is somewhat overloaded, and it may be desirable to use "polymorphic" when poss
  4 KB (598 words) - 02:44, 13 February 2021
• 99 questions/Solutions/62B
  ...evel N if the path from the root to the node has length N-1. The root node is at level 1. Write a predicate atlevel/3 to collect all nodes at a given lev Another possibility is to decompose the problem:
  741 bytes (125 words) - 13:40, 25 December 2016
• Gtk2Hs/Tutorials
  There is another nice and extensive tutorial at ...the deprecated Events module and to run some examples with gtk 0.10.1, it is necessary to include "import Graphics.UI.Gtk.Gdk.Events" in the program.
  1,006 bytes (151 words) - 04:25, 26 April 2021
• 99 questions/Solutions/31
  (**) Determine whether a given integer number is prime. ...is larger than '''1''' and no natural number ''n >= 2'' with ''n^2 <= k'' is a divisor of ''k''. However, we don't actually need to check all natural nu
  3 KB (432 words) - 07:06, 11 May 2016
• Android
  ...operating system for mobile devices, based on Linux; software development is mainly done in Java. See the [http://en.wikipedia.org/wiki/Android_(operati ...nding library [https://github.com/neurocyte/foreign-jni foreign-jni]; here is a demonstration of its use: [https://github.com/neurocyte/android-haskell-a
  3 KB (428 words) - 06:02, 17 September 2016
• Treeviz
  ...sualize how the elements of these trees are recombined, when the operation is evaluated, can help us make smarter choices about how to apply a particular One specific example is provided, a fast Fourier transform (FFT). Here is typical output from that example:
  2 KB (223 words) - 13:32, 28 April 2014
• Difference list
  A difference list representation of a list <hask>xs :: [T]</hask> is a function <hask>f :: [T] -> [T]</hask>, which when given another list <has Whether this kind of difference list is more efficient than another list representations depends on usage patterns.
  3 KB (421 words) - 16:40, 1 August 2018
• GHC/Concurrency/Flaws
  I have built (Feb 9, 2007) the HEAD version of GHC and this problem is no longer present. The description which was here has been deleted, but is still available in the historical views of this page.
  586 bytes (97 words) - 01:16, 26 April 2021
• KURE
  ...strategy control language in the tradition of Stratego and Strafunski. It is intended for writing reasonably efficient rewrite systems, makes use of typ ...ewrite abilities inside [[Hera| HERA]]. It was rewritten in late 2008, and is published on hackage. KURE will be used to power the next version of [[Hera
  1 KB (185 words) - 00:27, 12 July 2021
• 99 questions/Solutions/46
  The first step in this problem is to define the Boolean predicates: -- AND is True if both a and b are True
  4 KB (655 words) - 07:48, 27 April 2016
• Haskell projects needing help
  ...seful projects to do and there are always projects needing help. This page is meant to bring people and projects together. wxHaskell is a portable and native GUI library for Haskell. The goal of
  6 KB (833 words) - 00:37, 25 March 2015
• LondonInfrastructureHac2015
  The offical sign-up for this event is at [https://skillsmatter.com/conferences/7316-haskell-hackathon-2015 Skills ...Haskell eXchange 2015. It will be hosted at Pivotal Labs, London. Everyone is welcome, beginners and experts alike, and not just participants at the Hask
  2 KB (307 words) - 08:59, 10 October 2015
• GHC/TypeSigsAndAmbiguity
  ...pe signature. Usually this works fine, but alas not always. Perhaps this is a deficiency in GHC, but here's one way it can happen: The type variable ‘a0’ is ambiguous
  4 KB (716 words) - 11:30, 24 January 2016
• Cabal
  * Cabal is a package and build system. Cabal is only involved in the creation of packages and the building of their content ...e build system). This often confuses new users. Furthermore, Cabal-Install is not a fully featured package manager. For example, it cannot install non ca
  2 KB (244 words) - 12:34, 2 October 2020
• 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

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