Sign in
Code Monkey Have Fun
Options
Email Blog Author
RSS for posts
Atom
RSS for comments
OK
Search
Tags
Calculators
ChuckMoore
Color
colorForth
Concatenative Languages
Curiosities
Demo Code
F#
F18
Forth
FRP
FScheme
GA144
GreenArrays
HP35
HPCalcs
Interpreters
Pages
Project Euler
Recursion
RPN
Scheme
TransForth
Turtle Graphics
VMs
Archive
Archives
September 2014
(1)
July 2014
(1)
November 2013
(2)
October 2013
(1)
September 2013
(2)
April 2013
(1)
March 2013
(1)
April 2012
(3)
February 2012
(1)
January 2012
(2)
December 2011
(1)
September 2011
(2)
August 2011
(1)
June 2011
(1)
April 2011
(1)
March 2011
(2)
February 2011
(5)
January 2011
(2)
November 2010
(1)
October 2010
(1)
September 2010
(9)
June 2010
(2)
March 2010
(3)
February 2010
(3)
January 2010
(9)
December 2009
(2)
October 2009
(1)
September 2009
(4)
August 2009
(7)
April 2009
(3)
December 2008
(1)
September 2007
(1)
April 2007
(3)
November 2005
(1)
February 1996
(1)
Blog  Link List
Blogroll
Tomas Petricek
Harry Pierson
Dustin Campbell
Don Syme
Luca Bolognese
Luke Hoban
Matthew Podwysocki
James Iry
Steve Horsfield
Tom KirbyGreen
Mads Torgersen
Wes Dyer
Retro Programming  John Metcalf
Gram Wheeler
Favorites
Talks
Posts
Quotes
September, 2010
Posts
Subscribe via RSS
Sort by:
Most Recent

Most Views

Most Comments
Excerpt View

Full Post View
Code Monkey Have Fun
Fixing Decadesold Bugs in the HP35
Posted
over 5 years ago
by
Ashley Nathan Feniello
2
Comments
[Part 2 of the HP Calc series ] Making the JavaScriptbased HP35 microcode emulator has been a fun little project. Last time we disassembled the original bits from the ROM. I say “disassemble” but really our microcode instructions were...
Code Monkey Have Fun
Microcodelevel HP35 Emulator (in JavaScript!)
Posted
over 5 years ago
by
Ashley Nathan Feniello
5
Comments
[Part 1 of the HP Calc series ] I recently started a supergeeky side hobby of collecting vintage calculators and got my hands on a pair of HP calcs. The more I learned about the internals of the devices, the more intrigued I was. Jacques Laporte...
Code Monkey Have Fun
FScheme  Scheme in F#
Posted
over 5 years ago
by
Ashley Nathan Feniello
7
Comments
[Part 1 of the FScheme series ] One of my New Year’s goals is to reread Lisp in Small Pieces and implement all 11 interpreters and 2 compilers. As much as I like the "Lisp in Lisp" idea and enjoyed the eureka moment in SICP when Sussman writes...
Code Monkey Have Fun
Project Euler Problem #13
Posted
over 5 years ago
by
Ashley Nathan Feniello
0
Comments
First ten digits of sum of following onehundred 50digit numbers. It would be interesting to do without BigInts. Could use doubles with enough precision for just the first ten digits or some such thing, but just wanted the correct answer to plug into...
Code Monkey Have Fun
Project Euler Problem #12
Posted
over 5 years ago
by
Ashley Nathan Feniello
0
Comments
First triangle number to have over five hundred divisors. let naturals = Seq.unfold ( fun i > Some(i, i + 1)) 1 // from prob7 let triangleNums = Seq.scan (+) 0 naturals let isFactor n d = n % d = 0 let factors n = seq { 1..int (sqrt (float n))...
Code Monkey Have Fun
Project Euler Problem #11
Posted
over 5 years ago
by
Ashley Nathan Feniello
2
Comments
Greatest product of four adjacent numbers (up, down, left, right, or diagonally) in this 20x20 grid: let grid = [08;02;22;97;38;15;00;40;00;75;04;05;07;78;52;12;50;77;91;08; 49;49;99;40;17;81;18;57;60;87;17;40;98;43;69;48;04;56;62;00; 81;49;31;73;55;79;14;29;93;71;40;67;53;88;30;03;49;13;36;65;...
Code Monkey Have Fun
Project Euler Problem #10
Posted
over 5 years ago
by
Ashley Nathan Feniello
0
Comments
Sum of primes below twomillion. Easy problem, but way too slow (taking several minutes) with the naïve prime number generator from problem 7 . This new version is 10x faster, based on this paper: http://www.cs.hmc.edu/~oneill/papers/SieveJFP...
Code Monkey Have Fun
Project Euler Problem #9
Posted
over 5 years ago
by
Ashley Nathan Feniello
0
Comments
Pythagorean triplet where a + b + c = 1000 (2, 1) > Seq.unfold ( fun (m, n) – > Some([m * m  n * n; 2 * m * n; m * m + n * n], if n + 1 < m then m, n + 1 else m + 1, 1)) > Seq...
Code Monkey Have Fun
Project Euler Problem #8
Posted
over 5 years ago
by
Ashley Nathan Feniello
2
Comments
Largest products of five consecutive digits in this 1000digit number. open System.Numerics let digits n = Seq.unfold ( fun i – > if i = 0I then None else Some(i % 10I, i / 10I)) n let consecutive = Seq.unfold ( function (a : BigInteger) ...
Page 1 of 1 (9 items)
MSDN Blogs
>
Code Monkey Have Fun
>
September, 2010
Social Media Sharing