Search results

• Typeclassopedia
  ...o come up with a way to recursively apply a function to every element in a tree. ...hackage.haskell.org/package/containers/ containers library] (such as <code>Tree</code>, <code>Map</code>, and <code>Sequence</code>) are instances of <code
  179 KB (29,519 words) - 16:10, 30 December 2022
• GHC/As a library (up to 6.8)
  ...n the current API, this is probably only possible in the presence of a GHC tree that was built from source, including libraries. (Otherwise, there may be p
  18 KB (2,724 words) - 11:05, 17 January 2014
• Yhc/Javascript/Programmers guide/Up from the ground
  ...ile system, and no sequential flow of execution. Instead, there is the DOM tree of objects; some of them perform interaction with user input and provide vi
  21 KB (3,466 words) - 15:19, 6 February 2021
• Glome tutorial
  ...objects it finds, and pushes all transformations out to the leaves of the tree. In many cases, this will mean that the scene will consume more memory; ho ...will be tested with "rayint" as well! A single primitive type high in the tree that doesn't support "shadow" will force its entire subtree to be evaluated
  40 KB (6,787 words) - 01:19, 8 April 2014
• Regular expressions for XML Schema
  by manipulating the (internal tree like representation of the) regular expression ''r''.
  22 KB (3,425 words) - 22:34, 29 June 2021
• News/2007
  <li><p><em>An efficient lazy suffix tree library</em>. Bryan O'Sullivan ...afe/27891 posted] a [http://www.serpentine.com/software/suffixtree/ suffix tree library] to hackage. It implements Giegerich and Kurtz's lazy construction
  78 KB (11,405 words) - 03:19, 11 February 2008
• Applications and libraries/Program development
  ...et of Haskell. Running a compiled program creates an evaluation dependency tree as trace, a structure based on the idea of declarative debugging from the l
  19 KB (2,935 words) - 13:50, 22 August 2022
• Yhc/Erlang/Proof of concept
  #Change to the directory within the Yhc source tree: <code>cd src/translator/erlang/00proof</code>
  35 KB (5,478 words) - 17:40, 19 May 2008
• Research papers/Compilation
  ...://wwwtcs.inf.tu-dresden.de/~voigt/TOCS.pdf Formal Efficiency Analysis for Tree Transducer Composition]
  19 KB (2,599 words) - 00:14, 15 June 2023
• The Monadic Way/Part I
  Within a do block we can thus perform only tree kinds of operations:
  60 KB (9,727 words) - 17:00, 25 February 2010
• QuotesPage
  <cognominal> stands, for Glasgow Abstract Data Tree? ...thy> why not manage the stuff with darcs and have a clean tree and a build tree? :)
  55 KB (8,884 words) - 01:18, 10 November 2022
• Shootout/Knucleotide
  ...Kurtz/Giegerich: "A comparison of imperative and purely functional suffix tree constructions").
  56 KB (8,172 words) - 22:25, 18 February 2010
• Template Haskell
  ...is allows you to reify (convert from concrete syntax to an abstract syntax tree) some code, transform it and splice it back in (convert back again), or eve
  30 KB (4,551 words) - 00:29, 15 June 2023
• News/2006
  ...ional lazy interaction; server can serve up a real or a virtual filesystem tree; Standards compliant. ftphs was previously a part of the MissingH library. The main idea is to simplify browsing the entire portage tree as well as of
  93 KB (13,836 words) - 23:40, 14 August 2019
• All About Monads
  ...uses <code>foldM</code> to create a simple way to trace back in the family tree to any depth and in any pattern. In fact, it is probably clearer to write &
  169 KB (26,629 words) - 13:40, 27 May 2024

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