Reputation
Top tag
Next privilege 200 Rep.
See reduced ads
Badges
1 8
Newest
 Necromancer
Impact
~4k people reached

  • 0 posts edited
  • 0 helpful flags
  • 21 votes cast
Jan
25
awarded  Necromancer
Jan
11
awarded  Autobiographer
Apr
10
awarded  Critic
Mar
29
awarded  Student
Dec
16
awarded  Informed
Jun
20
comment Ring of numbers where adjacent entries sum up to a prime
do you have a link to this C++ code? anyway, generate-and-test under lazy evaluation is backtracking, "turning a failure into a list of successes", i.e. churning up lists of all solutions, where empty lists represent failure, and using append-map calls chained together as processing steps (so each solution is turned into a list of further refined solutions, and all is combined through append-map which is a join for a nondeterminism (list) monad). The key to efficiency is then early rejection.
Jun
5
revised What's the difference between recursion and corecursion?
corr.
May
13
awarded  Scholar
May
13
accepted Modern REPL for Haskell - is anybody working on it?
May
13
comment Modern REPL for Haskell - is anybody working on it?
thanks, looks very interesting. (love your nickname btw).
May
13
comment Modern REPL for Haskell - is anybody working on it?
@FrankShearar I'm no expert though.
May
13
revised Modern REPL for Haskell - is anybody working on it?
added 61 characters in body
May
13
asked Modern REPL for Haskell - is anybody working on it?
May
2
awarded  Editor
May
2
revised What's the difference between recursion and corecursion?
two more variants
May
2
awarded  Teacher
May
2
answered What's the difference between recursion and corecursion?
Mar
30
comment In Scheme, what is formally a program's state?
check out SECD machine. Also, "Introduction to Functional Programming Systems Using Haskell" 1992 by Davie, describes it on pp 109 - ... (preview on Google Books).
Nov
13
awarded  Supporter