¿Ü±¹µµ¼
ÄÄÇ»ÅÍ
ÀÎÅͳÝ/À¥ °³¹ß
2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.
Á¤°¡ |
15,000¿ø |
---|
15,000¿ø
750P (5%Àû¸³)
ÇÒÀÎÇýÅÃ | |
---|---|
Àû¸³ÇýÅà |
|
|
|
Ãß°¡ÇýÅÃ |
|
À̺¥Æ®/±âȹÀü
¿¬°üµµ¼
»óÇ°±Ç
ÀÌ»óÇ°ÀÇ ºÐ·ù
Ã¥¼Ò°³
Explains the concepts underlying programming languages, and demonstrates how these concepts are synthesized in the major paradigms: imperative, OO, concurrent, functional, logic and with recent scripting languages. It gives greatest prominence to the OO paradigm. Includes numerous examples using C, Java and C++ as exmplar languages Additional case-study languages: Python, Haskell, Prolog and Ada Extensive end-of-chapter exercises with sample solutions on the companion Web site Deepens study by examining the motivation of programming languages not just their features9780470853207Preface. PART I: INTRODUCTION. 1. Programming Languages. 1.1 Programming linguistics. 1.1.1 Concepts and paradigms. 1.1.2 Syntax, semantics, and pragmatics. 1.1.3 Language processors. 1.2 Historical development. Summary. Further reading. Exercises. PART II: BASIC CONCEPTS 2. Values and Types. 2.1 Types. 2.2 Primitive types. 2.2.1 Built-in primitive types. 2.2.2 Defined primitive types. 2.2.3 Discrete primitive types. 2.3 Composite types. 2.3.1 Cartesian products, structures, and records. 2.3.2 Mappings, arrays, and functions. 2.3.3 Disjoint unions, discriminated records, and objects. 2.4 Recursive types. 2.4.1 Lists. 2.4.2 Strings. 2.4.3 Recursive types in general. 2.5 Type systems. 2.5.1 Static vs dynamic typing. 2.5.2 Type equivalence. 2.5.3 The Type Completeness Principle. 2.6 Expressions. 2.6.1 Literals. 2. 6.2 Constructions. 2.6.3 Function calls. 2.6.4 Conditional expressions. 2.6.5 Iterative expressions. 2.6.6 Constant and variable accesses. 2.7 Implementation notes. 2.7.1 Representation of primitive types. 2.7.2 Representation of Cartesian products. 2.7.3 Representation of arrays. 2.7.4 Representation of disjoint unions. 2.7.5 Representation of recursive types. Summary. Further reading. Exercises. 3. Variables and Storage. 3.1 Variables and storage. 3.2 Simple variables. 3.3 Composite variables. 3.3.1 Total vs selective update. 3.3.2 Static vs dynamic vs flexible arrays. 3.4 Copy semantics vs reference semantics. 3.5 Lifetime. 3.5.1 Global and local variables. 3.5.2 Heap variables. 3.5.3 Persistent variables. 3.6 Pointers. 3.6.1 Pointers and recursive types. 3.6.2 Dangling pointers. 3.7 Commands. 3.7.1 Skips. 3.7.2 Assignments. 3.7.3 Procedure calls. 3.7.4 Sequential commands. 3.7.5 Collateral commands. 3.7.6 Conditional commands. 3.7.7 Iterative commands. 3.8 Expressions with side effects. 3.8.1 Command expressions. 3.8.2 Expression-oriented languages. 3.9 Implementation notes 3.9.1 Storage for global and local variables. 3.9.2 Storage for heap variables. Summary. Further reading. Exercises. 4. Bindings and Scope. 4.1 Bindings and environments. 4.2 Scope. 4.2.1 Block structure. 4.2.2 Scope and visibility. 4.2.3 Static vs dynamic scoping. 4.3 Declarations. 4.3.1 Type declarations. 4.3.2 Constant declarations. 4.3.3 Variable declarations. 4.3.4 Procedure definitions. 4.3.5 Collateral declarations. 4.3.6 Sequential declarations. 4.3.6 Recursive declarations. 4.3.8 Scopes of declarations. 4.4 Blocks. 4.4.1 Block commands. 4.4.2 Block expressions. 4.4.3 The Qualification Principle. Summary. Further reading. Exercises. 5. Procedural Abstraction. 5.1 Function procedures and proper procedures. 5.1.1 Function procedures. 5.1.2 Proper procedures 5.1.3 The Abstraction Principle. 5.2 Parameters and arguments. 5.2.1 Copy parameter mechanisms. 5.2.2 Reference parameter mechanisms. 5.2.3 The Correspondence Principle. 5.3 Implementation notes 5.3.1 Implementation of procedure calls. 5.3.1 Implementation of parameter passing. Summary. Further reading. Exercises. PART III: ADVANCED CONCEPTS. 6. Data Abstraction. 6.1 Program units, packages, and encapsulation. 6.1.1 Packages. 6.1.2 Encapsulation. 6.2 Abstract types. 6.3 Objects and classes. 6.3.1 Classes. 6.3.2 Subclasses and inheritance. 6.3.3 Abstract classes. 6.3.4. Single vs multiple inheritance. 6.3.5 Interfaces. 6.4 Implementation notes. 6.4.1 Representation of objects 6.4.2 Implementation ofmethod calls. Summary. Further reading Exercises. 7. Generic Abstra9780470853207Preface.PART I: INTRODUCTION.1. Programming Languages.1.1 Programming linguistics.1.1.1 Concepts and paradigms.1.1.2 Syntax, semantics, and pragmatics.1.1.3 Language processors.1.2 Historical development.Summary.Further reading.Exercises.PART II: BASIC CONCEPTS2. Values and Types.2.1 Types.2.2 Primitive types.2.2.1 Built-in primitive types.2.2.2 Defined primitive types.2.2.3 Discrete primitive types.2.3 Composite types.2.3.1 Cartesian products, structures, and records.2.3.2 Mappings, arrays, and functions.2.3.3 Disjoint unions, discriminated records, and objects.2.4 Recursive types.2.4.1 Lists.2.4.2 Strings.2.4.3 Recursive types in general.2.5 Type systems.2.5.1 Static vs dynamic typing.2.5.2 Type equivalence.2.5.3 The Type Completeness Principle.2.6 Expressions.2.6.1 Literals.2. 6.2 Constructions.2.6.3 Function calls.2.6.4 Conditional expressions.2.6.5 Iterative expressions.2.6.6 Constant and variable accesses.2.7 Implementation notes.2.7.1 Representation of primitive types.2.7.2 Representation of Cartesian products.2.7.3 Representation of arrays.2.7.4 Representation of disjoint unions.2.7.5 Representation of recursive types.Summary.Further reading.Exercises.3. Variables and Storage.3.1 Variables and storage.3.2 Simple variables.3.3 Composite variables.3.3.1 Total vs selective update.3.3.2 Static vs dynamic vs flexible arrays.3.4 Copy semantics vs reference semantics.3.5 Lifetime.3.5.1 Global and local variables.3.5.2 Heap variables.3.5.3 Persistent variables.3.6 Pointers.3.6.1 Pointers and recursive types.3.6.2 Dangling pointers.3.7 Commands.3.7.1 Skips.3.7.2 Assignments.3.7.3 Procedure calls.3.7.4 Sequential commands.3.7.5 Collateral commands.3.7.6 Conditional commands.3.7.7 Iterative commands.3.8 Expressions with side effects.3.8.1 Command expressions.3.8.2 Expression-oriented languages.3.9 Implementation notes3.9.1 Storage for global and local variables.3.9.2 Storage for heap variables.Summary.Further reading.Exercises.4. Bindings and Scope.4.1 Bindings and environments.4.2 Scope.4.2.1 Block structure.4.2.2 Scope and visibility.4.2.3 Static vs dynamic scoping.4.3 Declarations.4.3.1 Type declarations.4.3.2 Constant declarations.4.3.3 Variable declarations.4.3.4 Procedure definitions.4.3.5 Collateral declarations.4.3.6 Sequential declarations.4.3.6 Recursive declarations.4.3.8 Scopes of declarations.4.4 Blocks.4.4.1 Block commands.4.4.2 Block expressions.4.4.3 The Qualification Principle.Summary.Further reading.Exercises.5. Procedural Abstraction.5.1 Function procedures and proper procedures.5.1.1 Function procedures.5.1.2 Proper procedures5.1.3 The Abstraction Principle.5.2 Parameters and arguments.5.2.1 Copy parameter mechanisms.5.2.2 Reference parameter mechanisms.5.2.3 The Correspondence Principle.5.3 Implementation notes5.3.1 Implementation of procedure calls.5.3.1 Implementation of parameter passing.Summary.Further reading.Exercises.PART III: ADVANCED CONCEPTS.6. Data Abstraction.6.1 Program units, packages, and encapsulation.6.1.1 Packages.6.1.2 Encapsulation.6.2 Abstract types.6.3 Objects and classes.6.3.1 Classes.6.3.2 Subclasses and inheritance.6.3.3 Abstract classes.6.3.4. Single vs multiple inheritance.6.3.5 Interfaces.6.4 Implementation notes.6.4.1 Representation of objects6.4.2 Implementation of method calls.Summary.Further readingExercises.7. Generic Abstra9780470853207Programming languages exist to communicate with computers and also with people. A good language, like a good mathematical notation, helps us to formulate and communicate ideas more quickly. Yet thereare many programming languages and many features to understand in each.9780470853207This book explains the concepts underlying programming languages, demonstrates how these concepts are synthesized in the major paradigms: imperative, object-oriented, concurrent, functional, logic and scripting.9780470853207
ÀúÀÚ¼Ò°³
»ý³â¿ùÀÏ | - |
---|
ÇØ´çÀÛ°¡¿¡ ´ëÇÑ ¼Ò°³°¡ ¾ø½À´Ï´Ù.
ÁÖ°£·©Å·
´õº¸±â»óÇ°Á¤º¸Á¦°ø°í½Ã
À̺¥Æ® ±âȹÀü
ÄÄÇ»ÅÍ ºÐ¾ß¿¡¼ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥
ÆǸÅÀÚÁ¤º¸
»óÈ£ |
(ÁÖ)±³º¸¹®°í |
---|---|
´ëÇ¥ÀÚ¸í |
¾Èº´Çö |
»ç¾÷ÀÚµî·Ï¹øÈ£ |
102-81-11670 |
¿¬¶ôó |
1544-1900 |
ÀüÀÚ¿ìÆíÁÖ¼Ò |
callcenter@kyobobook.co.kr |
Åë½ÅÆǸž÷½Å°í¹øÈ£ |
01-0653 |
¿µ¾÷¼ÒÀçÁö |
¼¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù) |
±³È¯/ȯºÒ
¹ÝÇ°/±³È¯ ¹æ¹ý |
¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼ ½Åû °¡´É |
---|---|
¹ÝÇ°/±³È¯°¡´É ±â°£ |
º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É |
¹ÝÇ°/±³È¯ ºñ¿ë |
º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã |
¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯ |
·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì |
»óÇ° Ç°Àý |
°ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½ |
¼ÒºñÀÚ ÇÇÇغ¸»ó |
·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© ó¸®µÊ ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀǼҺñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ |
(ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
(ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.
¹è¼Û¾È³»
±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.
Ãâ°í°¡´É ½Ã°£ÀÌ ¼·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.
±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.
¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.