Understanding Computation: From Simple Machines to Impossible Programs"O'Reilly Media, Inc.", 15 мая 2013 г. - Всего страниц: 332 Finally, you can learn computation theory and programming language design in an engaging, practical way. Understanding Computation explains theoretical computer science in a context you’ll recognize, helping you appreciate why these ideas matter and how they can inform your day-to-day programming. Rather than use mathematical notation or an unfamiliar academic programming language like Haskell or Lisp, this book uses Ruby in a reductionist manner to present formal semantics, automata theory, and functional programming with the lambda calculus. It’s ideal for programmers versed in modern languages, with little or no formal training in computer science.
|
Другие издания - Просмотреть все
Understanding Computation: From Simple Machines to Impossible Programs Tom Stuart Ограниченный просмотр - 2013 |
Understanding Computation: Impossible Code and the Meaning of Programs Tom Stuart Недоступно для просмотра - 2013 |
Часто встречающиеся слова и выражения
abstract interpretation abstract syntax tree accept accept_states algorithm append the characters argument assignment behavior big-step semantics Boolean brackets call(e computation configuration cyclic tag system Data Structures def reducible denotational semantics deterministic Turing machines do-nothing DPDA encoding end end class end end end environment evaluate example execution false finite automata FizzBuzz free moves halting problem hello world implementation increment LCCall LCVariable loop forever machine’s match means method multiplication Nondeterminism nondeterministic finite automata NPDA Number.new(2 object operational semantics output parser parsing PDARule PDARule.new(2 perform possible Proc lambda programming language pushdown automaton puts expression recursive functions regular expression represent result returns Ruby program Ruby’s rulebook sequence simple simulation SKI combinator calculus SKICall small-step semantics source code stack state=1 statement static semantics struct PDAConfiguration SyntaxNode tape head there’s TMRule to_ast tokens true Turing machine Type::NUMBER Universal Systems variable write zero