Practical foundations for programming languages
"Syntactic Objects Programming languages are languages, a means of expressing computations in a form comprehensible to both people and machines. The syntax of a language specifies the means by which various sorts of phrases (expressions, commands, declarations, and so forth) may be combined to...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge ; New York :
Cambridge University Press,
2013.
|
| Subjects: | |
| Online Access: | An electronic book accessible through the World Wide Web; click to view |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ebr10656308 | ||
| 003 | CaPaEBR | ||
| 006 | m u | ||
| 007 | cr cn||||||||| | ||
| 008 | 120503s2013 enk sb 001 0 eng d | ||
| 010 | |z 2012018404 | ||
| 020 | |z 9781107029576 (hardback) | ||
| 020 | |z 9781107306844 (e-book) | ||
| 040 | |a CaPaEBR |c CaPaEBR | ||
| 035 | |a (OCoLC)828140158 | ||
| 050 | 1 | 4 | |a QA76.7 |b .H377 2013eb |
| 082 | 0 | 4 | |a 005.13 |2 23 |
| 100 | 1 | |a Harper, Robert. | |
| 245 | 1 | 0 | |a Practical foundations for programming languages |h [electronic resource] / |c Robert Harper. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2013. | ||
| 300 | |a xviii, 471 p. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 8 | |a Machine generated contents note: Part I. Judgments and Rules: 1. Inductive definitions; 2. Hypothetical judgments; 3. Syntactic objects; 4. Generic judgments; Part II. Levels of Syntax: 5. Concrete syntax; 6. Abstract syntax; Part III. Statics and Dynamics: 7. Statics; 8. Dynamics; 9. Type safety; 10. Evaluation dynamics; Part IV. Function Types: 11. Function definitions and values; 12. Godel's system T; 13. Plotkin's PCF; Part V. Finite Data Types: 14. Product types; 15. Sum patterns; 16. Pattern matching; 17. Generic programming; Part VI. Infinite Data Types: 18. Inductive and co-inductive types; 19. Recursive types; Part VII. Dynamic Types: 20. The untyped 1-calculus; 21. Dynamic typing; 22. Hybrid typing; Part VIII. Variable Types: 23. Girard's system F; 24. Abstract types; 25. Constructors and kinds; 26. Indexed families of types; Part IX. Subtyping: 27. Subtyping; 28. Singleton and dependent kinds; Part X. Classes and Methods: 29. Dynamic dispatch; 30. Inheritance; Part XI. Control Effects: 31. Control stacks; 32. Exceptions; 33. Continuations; Part XII. Types and Propositions: 34. Constructive logic; 35. Classical logic; Part XIII. Symbols: 36. Symbols; 37. Fluid binding; 38. Dynamic classification; Part XIV. Storage Effects: 39. Modernized algol; 40. Mutable data structures; Part XV. Laziness: 41. Lazy evaluation; 42. Polarization; Part XVI. Parallelism: 43. Nested parallelism; 44. Futures and speculation; Part XVII. Concurrency: 45. Process calculus; 46. Current algol; 47. Distributed algol; Part XVIII. Modularity: 48. Separate compilation and linking; 49. Basic modules; 50. Parameterized modules; Part XIX. Equivalence: 51. Equational reasoning for T; 52. Equational reasoning for PCF; 53. Parametricity. | |
| 520 | |a "Syntactic Objects Programming languages are languages, a means of expressing computations in a form comprehensible to both people and machines. The syntax of a language specifies the means by which various sorts of phrases (expressions, commands, declarations, and so forth) may be combined to form programs. But what sort of thing are these phrases? What is a program made of? The informal concept of syntax may be seen to involve several distinct concepts. The surface, or concrete, syntax is concerned with how phrases are entered and displayed on a computer. The surface syntax is usually thought of as given by strings of characters from some alphabet (say, ASCII or Unicode). The structural, or abstract, syntax is concerned with the struc- 4 1.1 Abstract Syntax Trees ture of phrases, specifically how they are composed from other phrases. At this level a phrase is a tree, called an abstract syntax tree, whose nodes are operators that combine several phrases to form another phrase. The binding structure of syntax is concerned with the introduction and use of identifiers: how they are declared, and how declared identifiers are to be used. At this level phrases are abstract binding trees, which enrich abstract syntax trees with the concepts of binding and scope. We will not concern ourselves in this book with matters of concrete syntax, but will instead work at the level of abstract syntax. To prepare the ground for the rest of the book, we begin in this chapter by definin-ing abstract syntax trees and abstract binding trees and some functions and relations associated with them. The definitions are a bit technical, but are absolutely fundamental to what follows. It is probably best to skim this chapter on first reading, returning to it only as the need arises"-- |c Provided by publisher. | ||
| 533 | |a Electronic reproduction. |b Palo Alto, Calif. : |c ebrary, |d 2013. |n Available via World Wide Web. |n Access may be limited to ebrary affiliated libraries. | ||
| 650 | 0 | |a Programming languages (Electronic computers) | |
| 655 | 7 | |a Electronic books. |2 local | |
| 710 | 2 | |a ebrary, Inc. | |
| 856 | 4 | 0 | |u http://site.ebrary.com/lib/daystar/Doc?id=10656308 |z An electronic book accessible through the World Wide Web; click to view |
| 999 | |c 197523 |d 197523 | ||