Search results

• 99 questions/61 to 69
  % leaves(T,S) :- S is the list of all leaves of the binary tree T % internals(T,S) :- S is the list of internal nodes of the binary tree T.
  12 KB (1,696 words) - 05:35, 11 June 2023
• Performance/Data types
  ...space leak, because both components must be fully evaluated to <tt>Int</tt>s when the constructor is built. GHC's strictness analyser will detect that f is strict in its argument, and compi
  5 KB (782 words) - 16:41, 4 February 2023
• GHC under Wine
  [[GHC]] runs flawlessly under Wine. Here's a guide on how to get it working. First, get the latest stable version of Wine from your distribution's repository, or from http://www.winehq.com/site/download.
  4 KB (574 words) - 07:28, 13 October 2014
• A new list type
  ...information as they build it. If <hask>map</hask> is applied to a list who's size is known, the size of the result is known. (Interestingly, if it isn't Especially when it's infinite. See [[Things to avoid]] for why you should try to avoid calling <
  3 KB (587 words) - 15:19, 6 February 2021
• Internationalization of Haskell programs using gettext
  Let's start with an example. Suppose that we want to make the following program m printf (__ "Hello, %s, how are you?") name
  10 KB (1,489 words) - 15:02, 26 October 2016
• Xmonad/Guided tour of the xmonad source
  ...the [http://www.haskell.org/haddock/ Haddock]-generated documentation (it's all in the source code, of course, but may be nicer to read this way). XMo Without further ado, let's begin!
  3 KB (531 words) - 09:09, 15 August 2017
• CabalFind
  ...). This query currently returns 28 results, and all what is needed for one's package to appear there is to make the package directory (darcs repo) be vi querySearchEngine :: SearchEngine s => s -- search engine request
  4 KB (666 words) - 22:21, 23 April 2021
• Opting for oracles
  * A brief mention appears in Conor McBride's representation of general recursion for use with total functional languages ...Mikael Rittri and Dan Synek show how ''pseudodata'' can make Peter Hancock's <tt>name_supply</tt> viable for regular use. A small implementation by Iavo
  6 KB (809 words) - 07:56, 12 June 2023
• Type
  ...tor]]s, each of which has a list of [[type variable]]s or [[type constant]]s. At the end, there is an optional <code>deriving</code>. Let's look at some examples. The Haskell standard data type [[Maybe]] is typical
  7 KB (1,016 words) - 15:20, 6 February 2021
• Monads as containers
  -- take a container full of a's, to each, apply f, How about join? Well, let's have a look at the types.
  18 KB (3,270 words) - 05:36, 9 March 2021
• 99 questions/Solutions/46
  ...ld each logic function from scratch; they could be shortened using Haskell's builtin equivalents: The table function in Lisp supposedly uses Lisp's symbol handling to substitute variables on the fly in the expression. I cho
  4 KB (655 words) - 07:48, 27 April 2016
• Installing xmonad log applet
  ...table installing unsupported gnome components outside your package manager's control. Unfortunately, so far as I know they must be installed to location ...et on another host and simply install it on the small device, however that's outside the scope of this discussion.
  6 KB (1,036 words) - 10:20, 20 April 2021
• Curry-Howard-Lambek correspondence
  show (OK s) = s show (Warning s) = "Warning: " ++ s
  8 KB (1,303 words) - 15:42, 18 November 2019
• Budapest Hackathon 2016/Talks
  == András Kovács - A tour of GHC 8 features == ...codebases. Then we will look into our extensive use of QuickCheck, how it's used and what we learned.
  4 KB (673 words) - 05:44, 26 October 2016
• Applications and libraries/Generic programming/Lightweight
  the representation(s) data type(s) to be defined in the library and From what I've seen, Ralf's "Fun with phantom
  5 KB (859 words) - 10:10, 20 April 2021
• Trash/DDC/ClosureTyping
  ...the ''same'' <hask>Int</hask> every time we call it, but the type says it's supposed to be fresh! The problem here is that <hask>x</hask> was free in o ...e inferred types easier to read, DDC names the closure terms in a function's type after the free variables that gave rise to those terms. The user is fr
  3 KB (472 words) - 04:20, 8 June 2023
• Performance
  Moreover, it's often not clear if two programs which supposedly have the same functionalit ..., and multi-language memory management can be complex and error-prone. It's usually better to stick to Haskell if possible.
  10 KB (1,392 words) - 21:39, 26 August 2018
• PermissiveImportsProposal
  ...ven we've explicitly asked for the identifiers from specific modules there's no reason for the compiler to assume we might want them from the Prelude or ...with a large number of imports and contributors. At least with a pragma it's opt-in, and easy to change if a project later decides the redundancy is use
  9 KB (1,515 words) - 23:39, 23 October 2014
• Budapest Hackathon 2016/Projects
  ...rocessors and scratchpad memories. The backend currently supports Adapteva's Epiphany many-core accelerator chip. However, the implementation of the com ...started off as a copy/paste of the hspec-discover but now has come into it's own. It has the possibility to be a general purpose test runner with some w
  5 KB (679 words) - 14:07, 5 August 2016
• Constructor
  ...de</hask>. <hask>Tip</hask> is a constructor that groups no value, i.e, it's a nullary constructor. There is only one value, conveniently denoted <hask> ...hose data are its parameters. The first one has type <hask>a</hask>, so it's just a value of the parameter type <hask>a</hask>. This one is the value th
  6 KB (1,060 words) - 16:51, 18 June 2021

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