000 02997nam a22003855i 4500
001 281177
003 MX-SnUAN
005 20160429154053.0
007 cr nn 008mamaa
008 150903s2011 xxk| o |||| 0|eng d
020 _a9780857290762
_99780857290762
024 7 _a10.1007/9780857290762
_2doi
035 _avtls000333796
039 9 _a201509030804
_bVLOAD
_c201404130535
_dVLOAD
_c201404092324
_dVLOAD
_y201402041132
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aDowek, Gilles.
_eautor
_9305908
245 1 0 _aIntroduction to the Theory of Programming Languages /
_cby Gilles Dowek, Jean-Jacques Lévy.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2011.
300 _axI, 118 páginas
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aLévy, Jean-Jacques.
_eautor
_9306636
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780857290755
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-85729-076-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c281177
_d281177