4190.310 Programming Languages (Spring 2011)
°ÀÇ: È/¸ñ 17:00 -18:15 @ 302µ¿ 106È£
´Ù¾çÇÑ ÇÁ·Î±×·¡¹Ö ¾ð¾îµéÀÌ Ç°°íÀÖ´Â °øÅëµÈ ¿ø¸®µéÀº ¹«¾ùÀΰ¡?
ÇöÀçÀÇ ÇÁ·Î±×·¡¹Ö ¾ð¾îµéÀº ¾ó¸¶¸¸Å ¹Ì°³ÇÑ°¡?
Á»´õ ³ª¾ÆÁö±â À§Çؼ ÇÊ¿äÇÑ °ÍµéÀº ¹«¾ùÀΰ¡?
»õ·Î¿î ÇÁ·Î±×·¡¹Ö ȯ°æÀ» È¿°úÀûÀ¸·Î ¿î¿ëÇÒ ¼ö ÀÖ´Â ¾ð¾î´Â ¹«¾ùÀΰ¡?
ÀÌ °ÀÇ¿¡¼´Â ÀÌ¿Í°°Àº Áú¹®µé¿¡ ´ëÇÑ ´äÀ» ÀÍÈ÷°Å³ª, ÁÁÀº ´äÀ» ¸¸µé¾î³»±â À§Çؼ
ÇÊ¿äÇÑ ¼Ò¾çÀ» ´Û°Ô µË´Ï´Ù.
¼÷Á¦: 80%, ¹ßÇ¥: 10%, ±âŸ: 10%.
- ¼ºÀûÀº Àý´ëÆò°¡ÀÔ´Ï´Ù.
- ÇÁ·Î±×·¥ ¼÷Á¦°¡ º£³¤°ÍÀ¸·Î Àû¹ßµÇ¸é ¼÷Á¦Á¡¼ö ¸ðµÎ
0Á¡ 󸮵˴ϴÙ. ¿¬±¸½Ç¿¡¼ °³¹ßÇÑ ÇÁ·Î±×·¥ À¯»çµµ¸¦ ÀÚµ¿À¸·Î °¨º°ÇØÁÖ´Â
¼ÒÇÁÆ®¿þ¾î°¡ »ç¿ëµË´Ï´Ù.
- ÇÁ·Î±×·¡¹Ö ¼÷Á¦:
- ³í¼ú ¼÷Á¦: ³í¹®À̳ª Ã¥µîÀ» ÀÐ°í ³»¿ëÀ» ¿ä¾àÇÏ°í ´À³¤Á¡À» ³í¼úÇÏ´Â
¼÷Á¦µé ÀÔ´Ï´Ù.
- 縰Áö: ¿©·¯ºÐ Á¤µµ¶ó¸é Çѹø µµÀüÇØ º¼ ¸¸ÇÑ ¹®Á¦µé
ÀÔ´Ï´Ù. ÇÑ ¹®Á¦¸¦ ¿Ã¹Ù¸£°Ô ÇØ°áÇϸé ÃÖÁ¾ ¼ºÀûÀÌ 1-3 ´Ü°è »ó½ÂÇÕ´Ï´Ù.
- ¼÷Á¦/縰Áö ½Ã°£Ç¥
-
Part 0 |
[0.pdf, 1.pdf, 2.pdf]
|
|
language, syntax, semantics
|
|
abstract syntax, concrete syntax, inductive definitions |
|
logic systems, inference rules, inductions |
Part I |
[3.pdf, 4.pdf, 5.pdf, 6.pdf]
|
|
imperative language: basic syntax, inference rules as semantics |
|
|
|
scopes, environment |
|
static/dynamic scoping, parameter passing |
|
procedures, data structures |
|
role of types, static/dynamic type system |
|
memory leak, dangling pointer, garbage collection |
|
translation, virtual machine |
Part II |
[7.pdf,8.pdf,9.pdf, SM5.pdf, 10.pdf
,11.pdf
,12.pdf
,13.pdf
,14.pdf
,15.pdf
]
|
|
language model: lambda calculus |
|
reduction strategies |
|
high-order applicative language |
|
safe type system, static type system, type discipline |
|
let-polymorphic type system, parametric polymorphism,
subtype system |
|
type system as language design |
|
data abstraction, modularity |
|
translation, virtual machine |
|
essence of object-oriented language, object, inheritance, subtype polymorphism |
|
logic vs computation, curry-howard correspondence |
|
program verification |
|
overview, future issues |
|
|