Search results
Results From The WOW.Com Content Network
A computer program is identified with the strongest predicate describing every relevant observation that can be made of the behaviour of a computer executing that program. [2] In UTP parlance, a theory is a model of a particular programming paradigm. A UTP theory is composed of three ingredients:
Using a carefully selected progression of subsets of the Oz programming language, the book explains the most important programming concepts, techniques, and models . Translations of this book have been published in French (by Dunod Éditeur, 2007), Japanese (by Shoeisha, 2007) and Polish (by Helion, 2005).
SICP has been influential in computer science education, and several later books have been inspired by its style. Structure and Interpretation of Classical Mechanics (SICM), another book that uses Scheme as an instructional element, by Gerald Jay Sussman and Jack Wisdom; Software Design for Flexibility, by Chris Hanson and Gerald Jay Sussman
A finite-state automaton from automata theory, a branch of theoretical computer science. Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation. It is difficult to circumscribe the theoretical areas precisely.
The Art of Computer Programming (TAOCP) is a comprehensive monograph written by the computer scientist Donald Knuth presenting programming algorithms and their analysis. Volumes 1–5 are intended to represent the central core of computer programming for sequential machines.
Programming language theory (PLT) is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification of formal languages known as programming languages. Programming language theory is closely related to other fields including mathematics, software engineering, and linguistics.
In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.It generalizes the Boolean satisfiability problem (SAT) to more complex formulas involving real numbers, integers, and/or various data structures such as lists, arrays, bit vectors, and strings.
Fundamental Concepts In Programming Languages at the Portland Pattern Repository; Fundamental Concepts In Programming Languages at the College of Information Sciences and Technology at Pennsylvania State University; ACM Digital Library; Great Works in Programming Languages. Collected by Benjamin C. Pierce