±×·¡ÇÈ
OA
¿î¿µÃ¼Á¦
ÀÎÅͳݰú ³×Æ®¿öÅ©
À¥ ÇÁ·Î±×·¡¹Ö
ÇÁ·Î±×·¡¹Ö ¾ð¾î
ºñÁÖ¾ó Åø
¸ÖƼ¹Ìµð¾î
µ¥ÀÌÅͺ£À̽º
´å³Ý(.NET)
±âŸ
 
 
HOME > µµ¼­¾È³» > ÇÁ·Î±×·¡¹Ö ¾ð¾î
 
 
ÇϽºÄ̷Π¹è¿ì´Â ÇÁ·Î±×·¡¹Ö Programming in Haskell
- Àú ÀÚ Graham Hutton Àú, ¾È±â¿µ ¹ÚÁ¤ÈÆ ¿Å±è
- ÆÇ¸Å°¡ 20,000 ¿ø
- ¹ßÇàÀÏÀÚ 2009-07-24
- ÆäÀÌÁö ¼ö 368 P
- ISBN 9788972808183
- E-mail ÀúÀÚ¿¡°Ô À̸ÞÀÏ º¸³»±â
 
[ÇϽºÄÌ ÇÁ·Î±×·¡¹Ö_¿ÀÅ»ÀÚ È®ÀÎ Site]

ÇϽºÄÌ ÇÁ·Î±×·¡¹ÖÀÇ µµ¼­ÀÇ ¿ªÀÚÀÎ [¾È±â¿µä«]²²¼­ ¿î¿µÀ» Çϰí ÀÖ´Â À¥»çÀÌÆ®¿¡¼­ º» µµ¼­ÀÇ ¿ÀÅ»ÀÚ ¹× ´Ù¾çÇÑ °Ô½Ã±ÛÀ» È®ÀÎÇÒ ¼ö ÀÖ½À´Ï´Ù.

http://pl.pusan.ac.kr/~haskell/wiki/FrontPage

=========================================================================================== ÀÌ ÀÔ¹®¼­´Â óÀ½ ÇÁ·Î±×·¡¹ÖÀ» ¹è¿ì´Â »ç¶÷¿¡°Ô °¡Àå ÀûÇÕÇÑ Ã¥ÀÌ´Ù.

ÇÁ·Î±×·¡¹Ö °æÇèÀÌ ÀüÇô ¾ø´Â »ç¶÷µµ ÀÌÇØÇÒ ¼ö ÀÖµµ·Ï ¸ðµç °³³äÀ» ±âÃʺÎÅÍ Â÷±ÙÂ÷±Ù ¾ö¼±µÈ ¿¹Á¦¸¦ °çµé¿© ¼³¸íÇÑ´Ù. °¢ Àå¿¡´Â ¾ÆÁÖ °£´ÜÇÑ ¹®Á¦ºÎÅÍ Ã¥¿¡¼­ ´Ù·ç´Â ÇÁ·ÎÁ§Æ®¸¦ È®ÀåÇÏ´Â µ¥ À̸£±â±îÁö ´Ù¾çÇÑ ³­À̵µÀÇ ¿¬½À¹®Á¦¸¦ Á¦°øÇÒ »Ó ¾Æ´Ï¶ó, °í±Þ ÁÖÁ¦¿¡ ´ëÇÑ ´õ ÀÐÀ»°Å¸®µµ ÃßõÇϰí ÀÖ´Ù. ÀúÀÚ´Â ¿©·¯ ÇØ µ¿¾È °­ÀÇÇÑ °æÇèÀ» ¹ÙÅÁÀ¸·Î ºÐ¸íÇÏ°í °£°áÇÏ°Ô ³»¿ëÀ» Ç¥ÇöÇϰí ÀÖ´Ù.

ÀÌ Ã¥ÀÇ Æ¯Â¡Àº ´ÙÀ½°ú °°´Ù.

NO1. °­»ç¿Í ÇлýµéÀ» À§ÇØ PPT ½½¶óÀÌµå ¹× ¿¬½À¹®Á¦ ¸ð¹ü´ä¾ÈÀ» ÇϽºÄÌ È¨ÆäÀÌÁö¿¡¼­ Á¦°øÇÑ´Ù.
NO2. °­»çµéÀº ÀÌ Ã¥À¸·Î ÁøÇàÇÏ´Â ¼ö¾÷ÀÇ ½ÃÇè¹®Á¦ »ùÇÃÀ» (¸ð¹ü´ä¾È°ú ÇÔ²²) ¿äûÇÒ ¼ö ÀÖ´Ù.
NO3. Ã¥¿¡¼­ ´Ù·ç´Â ÄÚµå´Â ¸ðµÎ ÃÖ±Ù ÇϽºÄÌ ±¸Çö¿¡¼­ Àß µ¿ÀÛÇϸç ȨÆäÀÌÁö¿¡¼­ ¹ÞÀ» ¼ö ÀÖ´Ù.
NO4. °­ÀÇ ´É·ÂÀÌ °ËÁõµÈ Àú¸íÇÑ ÇϽºÄÌ ¿¬±¸ÀÚÀÌÀÚ °­»çÀÎ ±×¶óÇÔ ÇãÆ° ±³¼ö°¡ Á÷Á¢ ÁýÇÊÇÏ¿´´Ù.


¢Ñ ¿Á½ºÆ÷µå ´ëÇÐÀÇ ¸®Ã³µå ¹öµå(Richard Bird) ±³¼ö´Â ÀÌ Ã¥À» ´ÙÀ½°ú °°ÀÌ ±ØÂùÇϰí ÀÖ´Ù.

"ÀÌ Ã¥Àº ÃʽÉÀÚ¸¦ À§ÇÑ ÀÔ¹®¼­·Î ÇϽºÄÌ·Î ÇÔ¼öÇü ÇÁ·Î±×·¡¹Ö¿¡ ´ëÇØ ¾ÆÁÖ Àß ¼Ò°³Çϴ åÀÔ´Ï´Ù. ÀÏ·ù °­»çÀÌÀÚ ¿¬±¸ÀÚ°¡ Àú¼úÇÑ Ã¥´ä°Ô Ã¥ÀÇ ³»¿ëÀÌ µ¶ÀÚµéÀÇ ½Ã¼±À» È® Àâ¾Æ²ø¸é¼­µµ ±º´õ´õ±â°¡ ¾øÀÌ °¡º­¿î ±¸¼ºÀ¸·Î ´ëÇÐ 1Çг⠽ÅÀÔ»ý¿¡°Ôµµ ¹«¸®°¡ ¾øÀ» ¸¸Å­ ´ëÇлýµéÀÇ ¼öÁØ¿¡ ´«³ôÀ̸¦ Àß ¸ÂÃß¾ú½À´Ï´Ù. ÀÌ Ã¥À» ÀüÀûÀ¸·Î ÃßõÇÕ´Ï´Ù."
 
 
¸ñÂ÷
¸Ó¸®¸» 
¿Å±äÀÌ ¸Ó¸®¸» 
̵̧ȍ 
---------------------------------------


1 ¼Ò°³ 
ÇÔ¼ö 
ÇÔ¼öÇü ÇÁ·Î±×·¡¹Öfunctional programming 
ÇϽºÄÌÀÇ Æ¯Â¡ 
¿ª»çÀû ¹è°æ 
ÇϽºÄÌ ¸Àº¸±â 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


2 ù°ÉÀ½ ¶¼±â 
Hugs ½Ã½ºÅÛ  
Ç¥ÁØ ¼­¸·standard prelude 
ÇÔ¼ö 
ÇϽºÄÌ ½ºÅ©¸³Æ® 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


3 ŸÀÔ°ú Ŭ·¡½º 
±âº» °³³ä 
±âº» ŸÀÔ 
¸®½ºÆ® ŸÀÔ 
¼ø¼­½Ö ŸÀÔ 
ÇÔ¼ö ŸÀÔ 
Ä¿¸®µÈcurried ÇÔ¼ö 
¿©·¯ ¸ð¾çpolymorphic ŸÀÔ 
¿©·¯ ÀǹÌoverloaded ŸÀÔ 
±âº» Ŭ·¡½º 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


4 ÇÔ¼ö Á¤ÀÇ 
»õ°ÍÀ» ¿¾°ÍÀ¸·ÎºÎÅÍ 
Á¶°Ç½Äconditional expression 
º¸Ãʼ± µî½Äguarded equation 
ÆÐÅÏ ¸ÅĪpattern matching 
¶÷´Ù½Älambda expression 
À߸°½Äsection 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


5 ¸®½ºÆ® Á¶°ÇÁ¦½Ã½Äcomprehension 
»ý¼º¿øgenerator 
º¸ÃÊguard 
Zip ÇÔ¼ö 
±ÛÁÙstring Á¶°ÇÁ¦½Ã½Äcomprehension 
Ä«À̻縣 ¾ÏÈ£Caesar cipher 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


6 µÇµµ´Â ÇÔ¼örecursive function 
±âº» °³³ä 
¸®½ºÆ®·Î µÇµ¹±â 
ÀÎÀÚ°¡ ¿©·µÀÏ ¶§ 
¿©·¯ °¥·¡·Î µÇµ¹±â 
¼­·Î ºÎ¸£¸ç µÇµ¹±âmutual recursion 
µÇµµ´Â ÇÔ¼ö Á¤ÀǸ¦ À§ÇÑ µµ¿ò¸» 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


7 ÇÔ¼ö¸¦ ÁÖ°í¹Þ´Âhigher-order ÇÔ¼ö 
±âº» °³³ä 
¸®½ºÆ® ´Ù·ç±â 
foldr ÇÔ¼ö  
foldl ÇÔ¼ö 
ÇÔ¼ö ÇÕ¼º ¿¬»êÀÚ 
±ÛÁÙstring Àü¼Û±â 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 


8 ÇÔ¼öÇü ¹®¹ý ºÐ¼®±â functional parser 
¹®¹ý ºÐ¼®±âparser 
¹®¹ý ºÐ¼®±â ŸÀÔ 
±âº» ¹®¹ý ºÐ¼®±â 
¼ø¼­´ë·Î ¿«±âsequencing 
¼±ÅÃchoice 
°£´ÜÇÑ ¹®¹ý ºÐ¼®±â À̲ø¾î³»±â 
ºóÄ­ ó¸® 
»ê¼ú½Ä ¹®¹ý ºÐ¼®Çϱâ 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 



9 ´ëÈ­½Äinteractive ÇÁ·Î±×·¥ 
´ëÈ­interaction 
ÀÔÃâ·Â ŸÀÔ 
±âº» µ¿ÀÛbasic action 
¼ø¼­´ë·Î ¿«±âsequencing 
°£´ÜÇÑ µ¿ÀÛ À̲ø¾î³»±â 
°è»ê±â 
»ý¸í °ÔÀÓgame of life 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 



10 ŸÀÔ°ú Ŭ·¡½º ¼±¾ð 
ŸÀÔ ¼±¾ð 
µ¥ÀÌÅÍ ¼±¾ð 
µÇµµ´Â ŸÀÔ 
´Ã Âütautology °Ë»ç±â 
Ãß»ó ±â°èabstract machine 
Ŭ·¡½º¿Í ÀνºÅϽº ¼±¾ð 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 



11 Ä«¿îÆ®´Ù¿î ¹®Á¦ countdown problem 
¼Ò°³ 
¹®Á¦¸¦ ¼ö½ÄÀ¸·Î Á¤¸®Çϱâ 
Áü½Â°°ÀÌ ¹«½ÄÇÑbrute-force Ç®ÀÌ 
»ý¼ºgenerationÇϸ鼭 °è»êevaluationÇϱâ 
´ë¼öÀû ¼ºÁúÀ» ÀÌ¿ëÇϱâ 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 



12 ´À±ßÇÑ °è»ê¹ýlazy evaluation 
¼Ò°³ 
°è»ê ¹æ½Äevaluation strategy 
³¡³²termination 
ÁÙÀ̱âreduction Ƚ¼ö 
¹«ÇÑ ±¸Á¶infinite structure 
¸ðµâ ¹æ½Ämodular ÇÁ·Î±×·¡¹Ö 
±ñ±ñÇÑ Àû¿ëstrict application 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 



13 ÇÁ·Î±×·¥¿¡ ´ëÇÑ ³í¸®Àû Áõ¸í 
µî½Ä ¹ÙÅÁÀÇ ³íÁõequational reasoning 
ÇϽºÄÌ ÇÁ·Î±×·¥¿¡ ´ëÇÑ ³íÁõ 
°£´ÜÇÑ º¸±âµé 
ÀÚ¿¬¼ö¿¡ ´ëÇÑ ±Í³³¹ý 
¸®½ºÆ®¿¡ ´ëÇÑ ±Í³³¹ý 
À̾îºÙÀ̱⠿¬»êÀÚ ¾ø¾Ö±â 
¹ø¿ª±â Á¤È®¼ºcompiler correctness 
[»ìÆìº¸±â] 
[¿¬½À¹®Á¦] 








[ºÎ·Ï] A Ç¥ÁØ ¼­¸·standard prelude 
Ŭ·¡½ºclass 
³í¸®°ªlogical value 
±ÛÀÚcharacter¿Í ±ÛÁÙstring 
¼önumber 
¼ø¼­½Ötuples 
¾Æ¸¶µµMaybe 
¸®½ºÆ®list 
ÇÔ¼öfunction 
ÀÔÃâ·Âinput/output 

[ºÎ·Ï] B ±âȣǥ ¹× Hugs ¸í·É¾î 

[ºÎ·Ï] C ¹ø¿ª ¿ë·Ê 

[Âü°í¹®Çå]

[Index]


							
 
ÃÑ 0 °³ÀÇ ¼­ÆòÀÌ ÀÖ½À´Ï´Ù. (µ¶ÀÚ¼­ÆòÀº ¼­Æò¾²±â¿¡¼­ ¾²½Ç ¼ö ÀÖ½À´Ï´Ù.)