Search results

• The Monad.Reader/Issue4/Solving Sudoku
  ...uses a combination of brute-force search, rule-based pruning of the search tree, and a simple but effective heuristic to guide it to the correct answer mor ...a search tree, by summing together all of the branches at each node in the tree: the first branch that succeeds is taken.
  18 KB (2,751 words) - 00:55, 10 May 2008
• Keywords
  ...le, to create a datatype to hold an [[Abstract_syntax_tree|abstract syntax tree]] for an expression, one could use: ...gins with the keyword module; here's an example for a module whose name is Tree:
  22 KB (3,350 words) - 04:31, 8 June 2023
• GHC/Data Parallel Haskell/Package NDP
  ...rg/trac/ghc/wiki/Building/Hacking how to build them]. Then, in the source tree, do the following
  6 KB (885 words) - 11:09, 21 August 2007
• HacBerlin2014/Topics
  * Frontend stuff, tree editor widget (Jürgen) * I would like to implement a decision tree library in Haskell.
  8 KB (1,326 words) - 20:19, 28 September 2014
• HXT
  ...arts and processing instructions. This data model makes it possible to use tree transformation functions as a uniform design of XML processing steps from p ...DOM (document object model) structure. The tree structure in HXT is a rose tree with a special XNode data type for storing the XML node information.
  48 KB (6,937 words) - 00:20, 27 April 2016
• Xmonad/Installing xmonad
  xmonad is in the ports tree. To install it,
  5 KB (613 words) - 20:56, 22 November 2016
• Euler problems/81 to 90
  tree from a given initial node to all other nodes. I then map over this tree with the nodes of the graph that are in the last
  21 KB (3,012 words) - 03:07, 8 December 2011
• Concurrency with oracles
  ...them to programs via a (theoretically) infinite structured value such as a tree, [[Opting for oracles|oracles]] allow for the controlled use of nondetermin
  4 KB (565 words) - 06:24, 12 June 2023
• HUnit 1.0 User's Guide
  ...cases. This means that the structure of a <code>Test</code> is actually a tree. Using a hierarchy helps organize tests just as it helps organize files in ...o a test rather than to a test case. This means that all nodes in the test tree, not just test case (leaf) nodes, can be labeled. Hierarchical naming helps
  23 KB (3,542 words) - 03:11, 15 May 2020
• Capitole de manual
  ...entru a implementa arborii sintaxei abstracte - eng: AST = abstract syntax tree. Am scris acest capitolul acesta în martie 2005, asa cum se vede si din im ...ator pentru a putea rula programele reprezentate prin AST (abstract syntax tree).
  9 KB (1,310 words) - 08:10, 17 February 2015
• Embedded domain specific language
  ...only build an interim Haskell data structure that reflects the expression tree. E.g. the Haskell expression <hask>a+b</hask> is translated to the Haskell
  5 KB (616 words) - 10:22, 10 June 2021
• Quotes
  <dons> the concurrency or binary tree benchmarks?
  3 KB (561 words) - 02:55, 26 April 2021
• Simonpj/Talk:FunWithTypeFuns
  ...e!) tree representation for Int." Was this meant to be Integer? Surely any tree representation for Int would be large but finite.
  14 KB (2,191 words) - 17:03, 18 February 2012
• Budapest Hackathon 2016/Talks
  ...'' We show how the simplest structured recursion schemes can drive generic tree manipulations. Catamorphisms perform bottom-up, while Anamorphisms do the o
  4 KB (673 words) - 05:44, 26 October 2016
• Applications and libraries/Linguistics
  * [http://trac.loria.fr/~geni GenI] is a surface realiser for Tree Adjoining Grammars. Surface realisation can be seen as the last stage in a === Tree Adjoining Grammar ===
  15 KB (2,211 words) - 16:44, 1 August 2021
• Shootout/Fannkuch
  -- NB. element subtree siblings! This is an n-ary tree data Tree a = Node a (Tree a) (Tree a) | Empty
  22 KB (3,539 words) - 00:49, 14 December 2016
• Research papers/Testing and correctness
  ...u.se/pub/publications/techrep/1996/r-96-23.ps.gz The evaluation dependence tree: an execution record for lazy functional debugging] ...yale.edu/homes/nilsson/Publications/ause1997.pdf The evaluation dependence tree as a basis for lazy functional debugging]
  11 KB (1,480 words) - 16:36, 1 August 2021
• 99 questions/Solutions/39
  -- tree-merging Eratosthenes sieve, primesTME of Q.31,
  5 KB (696 words) - 19:46, 18 January 2014
• 99 questions/Solutions/50
  The argument to <tt>htree</tt> is a list of (weight, tree) pairs, in order of increasing weight.
  5 KB (738 words) - 19:53, 18 January 2014
• AI/Genetic programming/Evolutionary chess
  ...order to "choose" a move. This would probably be represented with a <code>Tree ChessNode</code> monad, where <code>ChessNode</code> could be a number of d
  5 KB (819 words) - 01:04, 9 April 2021

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