Entities Mentioned

• Haskell
• Scheme
• John McCarthy
• Chung-chieh Shan
• Haskell-Cafe

1. Selecting a random node from a tree in one pass: from proof to code Optimal justification of text with Dynamic Programming Deriving fast functions to compute all subsets of size N Fast computation of Bernoulli numbers Representing knowledge about knowledge: ``Mr.S and Mr.P'' puzzle Cross-product of sequences A neuron that learns how to play blackjack Iterated zipping puzzles Eratosthenes and other number sieves Powers of three Total stre (Read Full Article)
   
   

   Related Articles

   • Supercompilation for Haskell
   • also mentions Haskell
   • Haskeem -- (almost) Scheme in Haskell
   • also written by herrmann
   • Ashish's Niti: Haskell, DSL and Monad
   • also mentions Haskell-Cafe
   • Continuations and delimited control
   • also mentions Chung-chieh Shan
   • LogicT.pdf (Objet application/pdf)
   • also published in okmij.org

   • Analyzing Book Sales
   • also mentions Scheme
   • history.pdf (application/pdf Object)
   • also mentions John McCarthy
   • Monads
   • also published in okmij.org
   • A Comparison of Imperative and Purely Functional Suffix Tree Constructions
   • also written by herrmann
   • porges " Matching checklists using Haskell
   • also written by herrmann

Login to comment.