Denotational semantics: The Scott-Strachey approach to programming language theory
β Scribed by Stoy J.E.
- Publisher
- MIT
- Year
- 1977
- Tongue
- English
- Leaves
- 451
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
MS-CIS-89-16, LOGIC & COMPUTATION 04
<p>In the 1930s, mathematical logicians studied the notion of "effective computΒability" using such notions as recursive functions, A-calculus, and Turing machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming l
In the 1930s, mathematical logicians studied the notion of "effective computΒ ability" using such notions as recursive functions, A-calculus, and Turing machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming lan
The interplay between mathematical logic and the theory of programming languages has aroused an increasing amount of interest during the last decades. In this research area, the mathematical fields of model theory, logic and ordered structures have received new stimuli from computer science. Simulta
The interplay between mathematical logic and the theory of programming languages has aroused an increasing amount of interest during the last decades. In this research area, the mathematical fields of model theory, logic and ordered structures have received new stimuli from computer science. Simulta