The current version of the ATS language apparently uses libgmp to avoid the mentioned overflow issue: http://sourceforge.net/p/ats-lang/mailman/message/30692243/ .
Actually, at least one: the Ruby version is just a port from Haskell and has the same syntax.
SICP doesn't really cover very much in the grand scheme of CS, so "like SICP" might mean ... ... something covering "how to do math". This might be an introductory real analysis or linear algebra book, or (alas, I…
I'm sorry for my brief answer. I'll expand a bit (really, I'm inlining part of Pierce's book): As you probably know, there are two major domains where lambda calculi appear: computability (which I know next to nothing…
All these statements/calculations/proofs are near-trivial once you've defined an appropriate semantics for your calculus - probably the easiest route is via a small-step operational semantics - see, e.g., Types and…
Niklaus Wirth's Oberon system (http://projectoberon.com/) includes a complete CPU (in Verilog), compiler, and OS. I haven't studied it, though. For a slightly more common architecture (although hopefully we are entering…
It seems like the answer is no (GS is Guy Steele): "I spent nine years on Fortress, a scientific programming language (the project is finished now, we decided to stop working on it)."…
There's good evidence that Turing machines do capture the right notion of computability. You can enhance a Turing machine in many ways without changing what it can compute. Further, Turing machines, the lambda calculus,…
Real analysis lectures of Francis Su at Harvey Mudd: http://www.youtube.com/playlist?list=PL0E754696F72137EC These could go with the either the book by W. Rudin or (haven't read) A. Browder. These are not easy for a…
The current version of the ATS language apparently uses libgmp to avoid the mentioned overflow issue: http://sourceforge.net/p/ats-lang/mailman/message/30692243/ .
Actually, at least one: the Ruby version is just a port from Haskell and has the same syntax.
SICP doesn't really cover very much in the grand scheme of CS, so "like SICP" might mean ... ... something covering "how to do math". This might be an introductory real analysis or linear algebra book, or (alas, I…
I'm sorry for my brief answer. I'll expand a bit (really, I'm inlining part of Pierce's book): As you probably know, there are two major domains where lambda calculi appear: computability (which I know next to nothing…
All these statements/calculations/proofs are near-trivial once you've defined an appropriate semantics for your calculus - probably the easiest route is via a small-step operational semantics - see, e.g., Types and…
Niklaus Wirth's Oberon system (http://projectoberon.com/) includes a complete CPU (in Verilog), compiler, and OS. I haven't studied it, though. For a slightly more common architecture (although hopefully we are entering…
It seems like the answer is no (GS is Guy Steele): "I spent nine years on Fortress, a scientific programming language (the project is finished now, we decided to stop working on it)."…
There's good evidence that Turing machines do capture the right notion of computability. You can enhance a Turing machine in many ways without changing what it can compute. Further, Turing machines, the lambda calculus,…
Real analysis lectures of Francis Su at Harvey Mudd: http://www.youtube.com/playlist?list=PL0E754696F72137EC These could go with the either the book by W. Rudin or (haven't read) A. Browder. These are not easy for a…