¹ø¿ª ¿ë·Ê:

¿µ¾î Àü°ø ´Ü¾î¸¦ Çѱ۷Π¹ø¿ªÇÑ ¿¹µéÀÔ´Ï´Ù. ÁÁÀº ¿¹µéÀ» µî·ÏÇØ Áֽʽÿä.
ÇÁ·Î±×·¡¹Ö ¾ð¾î ¹× ÇÁ·Î±×·¡¹Ö ½Ã½ºÅÛ ºÐ¾ßÀÔ´Ï´Ù.
µî·ÏµÈ ¿¹µéÀº emailÀ» ÅëÇØ Àü¹®°¡ÀÇ ½É»ç¸¦ °ÅÃļ­ ÀÌ°÷¿¡ ³²°ÔµË´Ï´Ù.
Ãß°¡ÇÒ ´Ü¾î³ª ã°í ½ÍÀº ´Ü¾î¸¦ ³ÖÀ¸¼¼¿ä.
¿µ¾î°­ÀÇ, ¼º±Õ°ü, Æз¯µ¥ÀÌ(JPG, HTML) (¼­¿ï´ë ´ëÇнŹ® [°ü¾Ç½ÃÆò], 3/21/2011)
¿ì¸®¸» ³í¹®¾²±âÀÇ ¿øÄ¢
°øºÎÀÇ ¾ð¾î (Á¦4ȸ ROSAEC ¼¾ÅÍ ¿öÅ©¼¥, 8/27/2010)

¸®½ºÆ®

[¿µ¾î·Î Á¤·Ä]

1Â÷ µî½Ä ³í¸®first order equational logic
A-Ç¥ÁØÇüA-normal form
[À̸§ÀÇ] À¯È¿¹üÀ§°¡ ¹Ì¸® °áÁ¤µÇ´Âstatic scoping
[À̸§ÀÇ] À¯È¿¹üÀ§°¡ ½ÇÇà Áß¿¡ °áÁ¤µÇ´Âdynamic scoping
°¡Àå À§ÀÇ ¼±¾ðtop declaration, top-level declaration
°¡Àå ÀϹÝÀûÀΠŸÀÔprincipal type
°¡Áö±¸Á¶tree
°¤Èù º¯¼ölocal variable
°¤Èù Á¤ÀÇlocal definition
°¤Èù ÇÁ·Î½ÃÁ®local procedure
°ªvalue
°ª °è»êÀ» ÃÖ´ëÇÑ ¹Ì·ç´Âlazy evaluation
°ª Á¤ÀÇvalue bind
°ª Á᫐ ½ºÅ¸ÀÏfunctional style
°ª Áß½ÉÀÇ ¾ð¾îfunctional language, applicative language
°ª Áß½ÉÀÇ ÇÁ·Î±×·¡¹Öfunctional programming
°ª ŸÀÔÀÇ ÀûÀÀvalue type enrichment
°ªÀ¸·Î È£Ãâ(Çϱâ)call by value
°ªÀÇ ÁּҷΠȣÃâ(Çϱâ)call by reference
°ªÀü´Þ È£Ãâcall by value
°°Àº ÇüÅÂisomorphism
°´Ã¼object
°Å·¡tradeoff
°ÅǪÁýtemplate
°ËÁõ±âverifier
°áÁ¤Àûdeterminisitc
°áÁ¤Çϱâbinding
°áÁ¤ÇÒ ¼ö ¾ø´Âundecidable
°áÇÕ ¿¬»êÀÚjoin operator
°áÇÕ¹ýÄ¢associativity
°è»êreduction, function application, computation
°è»ê ¹æ½Äcomputation strategy, evaluation strategy
°è»ê Àü·«computation strategy, evaluation strategy
°è»ê°úÁ¤ Àü´Þ º¯È¯continuation passing style transform
°è»ê°úÁ¤À» Àü´ÞÇÏ´Âcontinuation passing style
°è»êµÇÁö ¾Ê´Â ÄÚµådead code
°è»ê¹ýevaluation strategy, calculus
°è½Âfactorial
°è½Â(Í­ã«)ÇÔ¼öfactorial function
°èÃþ±¸Á¶, °èÃþ±¸Á¶ Çü¼ºÇϱâhierarchy
°íÂ÷ ŸÀÔÀ» °®Ãáhigher-order and typed
°íÂ÷ ÇÔ¼öhigh-order function
°øÇÐÀû °Å·¡tradeoff
°ü°è ¸®½ºÆ®association list
±¸Ã¼Àû ¹®¹ý ±¸Á¶concrete syntax
±¸ÇöµÈ ¼Ó»çÁ¤ÀÌ °¨Ãß¾îÁø ŸÀÔabstract type
±Ô¹ü ´ÜÇ×½Äcanonical monomial
±ÛÀÚ½Çstring
±â°èÁß½ÉÀÇ ¾ð¾îimperative language
񃧯primitive
±âÈ£symbol
±âȹ ȯ°æÀÇ ÀûÀÀenvironment enrichment
²¿¸®tail
²¿¸®Àç±ÍÈ£Ãâtail recursive
²Ãtype
³¡Àç±ÍÈ£Ãâtail recursive
³ª¸ÓÁötail
³ª¿­½Äsequence
³¹¸»term
³Ñħoverflow
³×Æ®¿öÅ© ±¸Ãànetwork
³×Æ®¿÷network
³í¸®Àû °ü°èlogical relation
³í¸®Çü Àṉ̀¸Á¶operational semantics
´Ù´ë´Ù ºÐ¼®poly-variant analysis
´Ù´ëÀÏ ºÐ¼®mono-variant analysis
´Ù¸¥¿ëµµ·Î Àç»ýµÈ ¸Þ¸ð¸®dangling pointer
´Ùº¯Çüpolymorphic
´Ù¼öÀÇ ÇÁ·Î±×·¥ È帧À» Çϳª ÀÌ»óÀ¸·Î ¿ä¾àÇÏ´Â ºÐ¼®poly-variant analysis
´Ù¼öÀÇ ÇÁ·Î±×·¥ È帧À» Çϳª·Î ¿ä¾àÇÏ´Â ºÐ¼®mono-variant analysis
´Ù½Ã ¾²±ârewrite
´Ù½Ã ¾²±â ±ÔÄ¢rewrite rule
´Ù½Ã ¾²±â¸¦ ÀÌ¿ëÇÑ ÀÇ¹Ì ±¸Á¶rewrite semantics
´ÙÁß º¯Á¾ ºÐ¼®poly-variant analysis
´ÙÇüpolymorphic
´ÙÇü ŸÀÔpolymorphic type
´ÙÇü ÇÔ¼öpolymorphic function
´ÙÇü¼ºpolymorphism
´ÙÇü¼ºÀ» °¡Áö´Â ºÐ¼®poly-variant analysis
´ÙÇü¼ºÀÌ ÀÖ´Ùbe polymorphic
´Ü¼ø ŸÀÔsimple type
´Ü¼øÇÑ ÀÚ±â ÂüÁ¶ ÇÔ¼öprimitive recursive function
´ÜÀ§ Á¶°Ç½Äatomic proposition
´ÜÀϼº ºÐ¼®mono-variant analysis
´ëÇ¥ ŸÀÔprincipal type
µ¥ÀÌŸ ±¸¼ºÀÚdata constructor
µ¥ÀÌŸ ±¸¼ºÀÚ Á¢¼Ó¹æ¾Èconstructor description
µ¥ÀÌŸ ±¸¼ºÀÚ Á¤ÀÇconstructor bind
µ¥ÀÌŸ ŸÀÔ Á¢¼Ó¹æ¾Èdata description
µµÃâ ¿ø¸®paramodulation
µ¿°­³­ ¸Þ¸ð¸®dangling pointer
µ¿°­³­ ¸Þ¸ð¸®ÁÖ¼Òdangling reference
µ¿ÀÏÈ­unification
µ¿Àû Àṉ̀¸Á¶dynamic semantics
µ¿Ä¡¸¸µé±â ³í¹ýequational reasoning
µ¿Çü¼ºhomomorphism
µÇµ¹¾Æ ¿Ã ÇÊ¿ä¾ø´Â ÀÚ±âÈ£Ãâtail recursive
µÚ¿¡ ºÙ´Âpostfix
µë¼º µë¼º »ç¿ëÇÏ´Â µ¥ÀÌŸ ±¸Á¶sparse data structure
µîÄ¡¸¸µé±â ³í¹ýequational reasoning
µðÀÚÀÎ °Å·¡tradeoff
µû·Îµû·Î Æ÷ÀåÇϱâmodularity
·¡Æ¼½ºlattice
·¹ÄÚµå ³»¿ëlabel row
¸®½ºÆ®list
¸¶Áö¸·¿¡ ÀÚ±âÀÚ½ÅÀ» ºÎ¸£´Âtail recursive
¸Å°³º¯¼öparameter
¸Ó¸®head
¸Þ¸ð¸® °èÃø±âheap profiler
¸Þ¸ð¸® µµ³­dangling pointer, dangling reference
¸Þ¸ð¸® ¹ÝÀÀside-effect
¸Þ¸ð¸® ¹ÝÀÀÀ» ÀÏÀ¸Å°Áö ¾Ê´Ânon-expansive
¸Þ¸ð¸® ¼ö°Ågarbage collection
¸Þ¸ð¸® ÀçÈ°¿ëgarbage collection
¸Þ¸ð¸® ÁÖ¼Òreference
¸Þ¸ð¸® Áß½ÉÀÇ ¾ð¾îimperative language
¸Þ¸ð¸® ÃâÇ÷, ¸Þ¸ð¸® ´©¼ömemory leak
¸Þ¸ð¸® ÇÔ¼ömemory function
¸Þ¸ð¸®¿¡ ¾²±âassignment
¸í·ÉÇü ¾ð¾îimperative language
¸í¸íÇϱâbinding
¸í»ç½Äterm
¸ð³ªµåmonad
¸ðµ¨ °ËÁõmodel checking
¸ðµÎ°¡ Á¤ÀÇµÈ ÇÔ¼ötotal function
¸ðµâstructure, module
¸ðµâ Á¢¼Ósignature matching
¸ðµâ Á¢¼Ó¹æ¾Èstructure description
¸ðµâ Á¤ÀÇstructure bind
¸ðµâ½Ästructure expression
¸ðµâŸÀÔsignature
¸ðµâŸÀÔ Á¤ÀÇsignature bind
¸ðµâÇÔ¼öfunctor
¸ðµâÇÔ¼ö ŸÀÔÀÇ ½ÇÇöinstantiation, functor signature instantiation
¹«´õ±â ÆÐÅÏor-pattern
¹­´Ùbind
¹­ÀÌÁö ¾ÊÀº º¯¼öfree variable
¹­ÀÌÁö ¾ÊÀº À̸§free identifier
¹­ÀÌÁö ¾ÊÀº ŸÀÔ À̸§free type name
¹®¹ýgrammar
¹®¹ý ±¸Á¶syntax
¹®¹ý ±¸Á¶ ºÐ¼®syntax analysis
¹®¹ý±¸Á¶syntax
¹®¹ýÀûÀÎ Á¦¾àsyntactic constraint
¹°°Çobject
¹°°Ç Áß½ÉÀÇ ¾ð¾îobject-oriented language
¹Ø¹Ù´ÚÀÌ Æ°½ÇÇÑwell founded
¹Ù²ãÄ¡±âsubstitution
¹Ù´Úbottom
¹Ù´ÚÀÌ °®Ãß¾îÁøwell founded
¹Ýº¹Àûiterative
¹æÇ⼺associativity
¹è¿­ ³»¿ëarray row
¹ø¿ª ´ÜÀ§compilation unit
¹ø¿ª±âcompiler
º¯¼övariable
ºÒº¯¼ºÁúinvariant
ºÒ¿ÏÀüÇÑincomplete
ºÙ¹ÚÀÌbuilt-in
ºñ°áÁ¤Àûnon-deterministic
ºü¶ß¸²ÀÌ ¾øÀ½completeness
»çÀüÀû ¼ø¼­lexicographic order
»çÀüÀû ¼ø¼­ °ü°èlexicographic order
»óÈ£¿î¿ë¼ºinteroperability
»õ·Î¿î »ç½ÇÀÌ µµÃâµÇÁö ¾ÊÀ» ¶§±îÁö À¯µµÇÏ´Â Áõ¸í±âsaturation prover
»õÄ¡±âinfix
»ý¼ºÀÚconstructor
»ý¼ºÀûgenerative
¼­·Î ¸Â¹°·Á¼­ È£ÃâÇÏ´Âmutual recursive
¼­·Î È£ÃâÇÏ´Âmutual recursive
¼­¼ú³í¸®descriptive logic, predicate logic
¼­¼ú½Äpredicate
¼±¾ðdeclaration
¼±ÅýÄcase expression
¼±ÅÃÀÚselector
¼³ÅÁ ±¸Á¶¸¦ Ç®´Ùde-sugar
¼³ÅÁ±¸Á¶¸¦ ³ìÀÌ´Ùde-sugar
¼À¹ýcalculus
¼Ò±ØÀûÀÎ °è»ê¹ýlazy evaluation
¼Ó³»¿ë °¡¸®±âabstraction
¼Ó³»¿ëÀ» ½Å°æ¾²Áö ¾Ê°ÔÇϱâdata abstraction, ¼Ó³»¿ë °¨Ãß±â
¼Ó³»¿ëÀÌ °¨Ãß¾îÁø ŸÀÔabstract type
¼Ó¼º ¹®¹ýattribute grammar
¼ö·Å¼ºconvergence
¼ö·ÅÇÏ´Âconvergent
¼ö¹ÝµÇ´Â ¹ÝÀÀside-effect
¼öÇàreduction
¼ø¼­ °ü°èordered relation
¼ø¼­ Áß½ÉÀÇ ¾ð¾îimperative language
¼ýÀÚdigit
½Äexpression
½ÄÀü´Þ È£Ãâcall by name
½ÇÇàinterpretation
½ÇÇà È帧 ºÐ¼®control flow analysis
½ÇÇà°úÁ¤ ºÐÇÒ(Çϱâ)trace partitioning
½ÇÇà°úÁ¤À» »ý°¢ÇÏ´Â Àṉ̀¸Á¶operational semantics
½ÇÇà±âinterpreter
½ÇÇàÀü¿¡ °áÁ¤µÇ´Â À̸§ÀÇ ½Çüstatic scoping
½ÇÇàÁß¿¡ µå·¯³ª´Â À̸§ÀÇ ½Çüdynamic scoping
¾ÈÀü¼ºsoundness
¾ÈÀüÇÏ°Ô Á¤·®ÀÚ¸¦ Á¦°ÅÇÏ´Â ±â¹ýSkolemization
¾ÕÀ¸·Î ÇÒ °è»êcontinuation
¾ÕÀ¸·Î ÇÒ ÀÏcontinuation
¾ÕÀ¸·Î ÇÒ ÀÏÀ» Àü´ÞÇÏ´Âcontinuation passing style
¾ÕÀ¸·Î ÇÒ ÀÏÀ» ÇÔ¼ö·Î Á¤¸®Çؼ­ Àü´ÞÇØÁÖ´Âcontinuation passing style
¾î¿ï¸®±âmatch
¾îÈÖ ¸¸µå´Â ¹æ¹ýlexical conventions
¾ð±ÞÇÏ´Ùrefer
¾ð¾î¸¦ ±â¼úÇÏ´Â ¾ð¾îmetalanguage
¾ð¾îÀÇ ±â°è¾î º¯È¯compilation
¾ðÄ¿¸µuncurrying
¾ø¾îÁø ¸Þ¸ð¸®dangling pointer
¾ø¾îÁø ¸Þ¸ð¸®ÁÖ¼Òdangling reference
¿©·¯ ¸ð¾çÀÇpolymorphic
¿©·¯ ŸÀÔÀ» °¡Áö´Âpolymorphic
¿¬»êÀÚoperator
¿¬¿ª ¹ýÄ¢deduction rule
¿¹¿Ü»óȲexception
¿¹¿Ü»óȲ °ü¸®exception handling
¿¹¿Ü»óȲ ºÐ¼®exception analysis
¿¹¿Ü»óȲ Á¢¼Ó¹æ¾Èexception description
¿¹¿Ü»óȲ Á¤ÀÇexception bind
¿¹¿Ü»óȲ ó¸®exception handling
¿À·ùerror
¿Ã¹Ù¸£°Ô ±âÃÊÇÏ¿´´Ùwell founded
¿Ã¹Ù¸§correctness
¿ÏÀü¼ºcompleteness
¿ÏÀüÇÑ ÀÚ±â ÂüÁ¶ ÇÔ¼ötruely recursive function
¿ÜºÎ ¾ð¾î Á¢¼Óforeign language interface
¿ä¾àabstraction
¿ä¾àµÈ Àṉ̀¸Á¶abstract semantics
¿ì¹°¾È Á¤ÀÇlocal definition
¿ì¼±¼øÀ§precedence
¿ø½ÃÀû ÀÚ±âÂüÁ¶ Á¤ÀÇrecursive primitive definition
¿ø½ÃÀûÀÎ ÀÚ±â ÂüÁ¶ ÇÔ¼öprimitive recursive function
À§ÁÖÀÇbound
À¯ÇѼºfiniteness
À¯È¿¹üÀ§scope
À¯È¿¹üÀ§°¡ Á¦ÇÑµÈ º¯¼ölocal variable
À¯È¿¹üÀ§°¡ Á¦ÇÑµÈ ÇÁ·Î½ÃÁ®local procedure
ÀÇ¹Ì ±¸Á¶semantics
ÀÇÁ¸¼º ºÐ¼®depedency analysis
À̸§Áþ´Ùbind
ÀÌ¹Ì ÀÖ´Âbuilt-in
ÀÌÁøbinary
ÀÎÀÚargument, parameter
ÀÎÀÚ Å¸ÀÔ¿¡ »ó°ü¾ø´Â ÇÔ¼öpolymorphic function
ÀÎÀÚ°¡ µÎ°³ÀÎbinary
ÀÎÀÚ°¡ ÇϳªÀÎunary
ÀÎÀÚ¸¦ ÅëÇؼ­¸¸ ¿ÜºÎ¿Í ¼ÒÅëÇÏ°Ô ÇÏ´Â º¯È¯closure conversion
ÀÏ°ü¼ºconsistency
ÀÏ´Ü °ªÀ» °è»êÇÏ°í º¸´Âstrict evaluation, eager evaluation
ÀϹÝÈ­µÈ ¸ðµâparameterized module
ÀϺθ¸ Á¤ÀÇµÈ ÇÔ¼öpartial function
ÀÏ»óÀûÀÎ Àṉ̀¸Á¶operational semantics
ÀÓÀÇ ÆÐÅÏwild pattern
ÀÙ»õleaf
ÀÚ±â È£Ãâ ÇÔ¼örecursive function
ÀÚ±â È£ÃâÀÌ ¸¶Áö¸·ÀÎtail recursive
ÀÚ±âÀÚ½ÅÀ» ºÎ¸£´Ârecursive
ÀÚ±âÀÚ½ÅÀ» ºÎ¸£´Â ÇÔ¼örecursive function
ÀÚ±âÂüÁ¶ ¾øÀÌ´Â Á¤ÀÇÇÒ ¼ö ¾ø´Â ÇÔ¼ötruely recursive function
ÀÚ±âÈ£Ãârecursive
ÀÚ·á ±¸Á¶data structure
ÀÚÀ¯·Î¿î º¯¼öfree variable
ÀÚÀ¯·Î¿î À̸§free variable, free identifier
ÀÚÀ¯º¯¼öfree variable
Àû±ØÀû °è»ê¹ýstrict evaluation
Àû±ØÀûÀÎ °è»ê¹ýevaluation by value, eager evaluation
Àû½Ã °è»ê¹ýcall by need
Á¢¼Ó¹æ¾Èinterface
Á¤ÀÇÇϱâbinding
Á¤ÀÇÇÏ´Ùbind
Á¤Àû Àṉ̀¸Á¶static semantics
Á¤È®¼ºcorrectness
Á¦´ë·Î ±¸¼ºµÈwell-formed
Á¦¶§ °è»ê¹ýcall by need, lazy evaluation
Á¦¾à½Äconstraint expression
Á¶°Ç °¡Áöconditional branch
Á¶°Ç½Ä ¿ä¾à, Á¶°Ç½ÄÀ» ÇϳªÀÇ º¯¼ö·Î ¿ä¾àÇϱâpredicate abstraction
Á¶°ÇÀÚpredicate
Á¼È÷±ânarrowing
ÁÖ¼ÒÀü´Þ È£Ãâcall by reference
ÁÙÀ̱âreduction
Áß°£°ªÀ» ä¿ö³ª°¡´Â Áõ¸í±âinterpolating prover
Áö¿ªÀûÀÎ Á¤ÀÇlocal definition
Áö¿¬ °è»ê¹ýlazy evaluation
Âü°ÅÁþ ÀÚµ¿ ÆǺ°±â, Á¶°Ç½Ä ÀÚµ¿ °ËÁõ±âdecision procedure
Âü°í¼­reference manual
ÂüÁ¶reference
ÃÖ´ëÇÑ ¹Ì·ç¾î °è»êÇÏ´Â ¹æ¹ýdelayed evaluation
Ãß»óÀûÀΠŸÀÔabstract type
Ãß»óÇüabstract type
Ãß»óÈ­abstraction
ÃàÁö¹ýwidening
ġȯ ÇÔ¼ösubstitution
Ä¿¸®¹æ½ÄÀ¸·Î °íÂ÷È­µÈ ÇÔ¼öcurried function
Ä¿¸®Çü ÇÔ¼öcurried function
Ä¿¸®Çü ÇÔ¼öÀÇ Àû¿ëcurried application
ÄÄÆÄÀÏ ´ÜÀ§compilation unit
ÄÄÆÄÀÏ·¯compiler
ÄÄÇ»Åͷδ ºÒ°¡´ÉÇÑundecidable
ŸÀÔtype constructor, type
ŸÀÔ ±¸¼ºÀÚtype constructor
ŸÀÔ ±¸Á¶type structure
ŸÀÔ ±¸Á¶ÀÇ ÀûÀÀtype structure enrichment
ŸÀÔ ±ÔÄ¢typing rule
ŸÀÔ º¯¼ötype variable
ŸÀÔ ½ÇÇötype realization
ŸÀÔ À¯Ãßstatic type synthesis, type inference
ŸÀÔ Á¢¼Ó¹æ¾Ètype description
ŸÀÔ Á¤ÀÇtype bind
ŸÀÔ ÁÙÀÓ¸»type abbreviation
ŸÀÔ Ã¼°ètype system
ŸÀÔ Æ²type scheme, scheme
ŸÀÔ Æ²ÀÇ ÀûÀÀtype scheme generalization
ŸÀÔ¸¸µé±â ±ÔÄ¢typing rule
ŸÀÔ½Ätype expression, type construct
ŸÀÔÀ» °°°Ô ÇÏ´Âunification
Å×½ºÅÍ ÄÚµåscaffolding code
Å×½ºÆ® ¹ßÆÇ ÄÚµåscaffolding code
Æ©ÇÃtuple
Ʋ¸ÂÃã, ±Ô°ÝÈ­normalization
Ʋ¿¡¸Â´Â ÇüÅÂ, ±Ô°Ý¿¡¸Â´Â ÇüÅÂnormal form
Æı«ÀûÀÎdestructive
ÆÐÅÏpattern
ÆÐÅÏ ¸ÂÃß±âmatch
ÆÐÅÏ°ú ¾î¿ï¸®±âpattern match
ÆÐÅÏ¿¡ ¸ÂÃß±âpattern match
Ç¥½ÃÀûsemantics
Ç¥ÁØÇünormal form
Ç¥ÁØÈ­normalization
ÇÁ·Î±×·¡¹Ö ¾ð¾îprogramming language
ÇÁ·Î±×·¥ ¹ø¿ªcompilation
ÇÁ·Î±×·¥ ºÐ¼®static analysis
ÇÁ·Î±×·¥½Äexpression
ÇÁ·Î±×·¥ÀÇ ±âȹstatic semantics
ÇÁ·Î±×·¥ÀÇ ½ÇÇàdynamic semantics
ÇÒÀÏÀÌ µþ·ÁÀÖ´Â ¹®¹ýattribute grammar
ÇÔ²²¿À´Â ¹ÝÀÀside-effect
ÇÔ¼ö ¾ð¾îfunctional language
ÇÔ¼ö Àû¿ë½Äfunction application
ÇÔ¼ö Á᫐ ½ºÅ¸ÀÏfunctional style
ÇÔ¼ö Áß½ÉÀÇ ¾ð¾îfunctional language
ÇÔ¼ö Áß½ÉÀÇ ÇÁ·Î±×·¡¹Öfunctional programming
ÇÔ¼ö È£Ãâfunction application
ÇÔ¼ö È帧 ºÐ¼®control flow analysis
ÇÔ¼ö°ª, ÀÚÀ¯º¯¼ö°ªÀÌ °áÁ¤µÈ ÇÔ¼öclosure
ÇÔ¼ö¸¦ ÁÖ°í ¹Þ´Â ÇÔ¼öhigh-order function
ÇÔ¼ö½Äfunction expression
ÇÔ¼öÀÇ ÀÎÀÚfunction argument
ÇÔ¼öÀÇ ÀÚÀ¯ º¯¼ö¸¦ ¾ø¾ÖÁÖ´Â º¯È¯closure conversion
ÇÔ¼öÀÇ Âþ¼ö¸¦ Çϳª¾¿ ³·Ãß´Âcurried application
ÇÔ¼öÈ帧 ºÐ¼®closure analysis
ÇÙ½É ¹®¹ý±¸Á¶abstract syntax
ÇൿÁöħÇü ¾ð¾îimperative language
Çê ¸Þ¸ð¸® ÁÖ¼Òdangling reference, dangling pointer
Çütype
Çü½ÄÀÎÀÚformal parameter
ÇüÅ ¹®¹ýshape grammar
È£Ãâapplication
ȯ°æenvironment
ȯ°æ ÇÔ¼öenvironment function