000 03073nam a22004935i 4500
001 978-0-85729-076-2
003 DE-He213
005 20140220083712.0
007 cr nn 008mamaa
008 101209s2011 xxk| s |||| 0|eng d
020 _a9780857290762
_9978-0-85729-076-2
024 7 _a10.1007/978-0-85729-076-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aDowek, Gilles.
_eauthor.
245 1 0 _aIntroduction to the Theory of Programming Languages
_h[electronic resource] /
_cby Gilles Dowek, Jean-Jacques Lévy.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2011.
300 _aXI, 118p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310
505 0 _a1. Terms and Relations -- 2. The Language PCF -- 3. From Evaluation to Interpretation -- 4. Compilation -- 5. PCF with Types -- 6. Type Inference -- 7. References and Assignment -- 8. Records and Objects -- 9. Epilogue -- 10. Index -- 11. Bibliography.
520 _aThe design and implementation of programming languages, from Fortran and Cobol to Caml and Java, has been one of the key developments in the management of ever more complex computerized systems. Introduction to the Theory of Programming Languages gives the reader the means to discover the tools to think, design, and implement these languages. It proposes a unified vision of the different formalisms that permit definition of a programming language: small steps operational semantics, big steps operational semantics, and denotational semantics, emphasising that all seek to define a relation between three objects: a program, an input value, and an output value. These formalisms are illustrated by presenting the semantics of some typical features of programming languages: functions, recursivity, assignments, records, objects, ... showing that the study of programming languages does not consist of studying languages one after another, but is organized around the features that are present in these various languages. The study of these features leads to the development of evaluators, interpreters and compilers, and also type inference algorithms, for small languages.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aLogics and Meanings of Programs.
700 1 _aLévy, Jean-Jacques.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780857290755
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
856 4 0 _uhttp://dx.doi.org/10.1007/978-0-85729-076-2
912 _aZDB-2-SCS
999 _c105123
_d105123