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/ .
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…
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,…
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/ .
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…
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,…