Search results

• 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
• Parsing expressions and statements
  We will parse these grammars into an internal representation (abstract syntax tree). (In some applications you skip the internal representation and go straigh
  8 KB (1,033 words) - 02:43, 21 March 2018
• Introducere in Haskell 98 prin exemple
  ...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
  6 KB (877 words) - 05:53, 21 June 2011
• AngloHaskell/2009
  ...ls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. ...where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as first-class objects th
  14 KB (2,363 words) - 22:42, 16 November 2009
• Yhc/TMR
  ...ntry means that with merely the Haddock description of our abstract syntax tree, most Haskell programmers can feel at home with relatively little effort. In general, data values in Haskell are tree-shaped. The function
  28 KB (4,378 words) - 13:10, 8 April 2007
• HIDE
  ...d files view. The files view would list all files in the project directory tree, selecting any of the would allow you to edit the file. The modules view on ...ools respecvely. That would allow the user to configure it with one single tree view rather than having multiple tabs. It would also allow a view to show o
  24 KB (4,039 words) - 04:38, 24 April 2021
• GHC/Data Parallel Haskell
  ...uer algorithms) and irregular data structures (such as sparse matrices and tree structures). An introduction to nested data parallelism in Haskell, includ The tree is inductively defined; hence, tree traversals will proceed sequentially, level by level. However, the childre
  21 KB (3,158 words) - 08:39, 10 August 2022
• Diagrams/Contributing
  cabal install monoid-extras/ dual-tree/ diagrams-core/ diagrams-lib/ diagrams-cairo/ diagrams-contrib/
  9 KB (1,429 words) - 02:17, 19 April 2015
• HXT/Conversion of Haskell data from/to XML
  approach, reading in simple tags and text elements and not building a tree structure, We can create an HXT tree from a single-layer data class as follows:
  28 KB (3,540 words) - 18:19, 5 January 2015
• Applications and libraries/Games
  ;[http://projects.haskell.org/game-tree/ game-tree] :game-tree is a purely functional library for searching game trees - useful for zero-s
  15 KB (2,258 words) - 16:22, 1 July 2023
• Simonpj/Talk:ListComp
  ...andard function (group). Plus with the knowledge of the keywords the parse tree is entirely different. From your paper:
  11 KB (1,836 words) - 02:36, 25 September 2007

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