¹ø¿ª ¿ë·Ê:

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

¸®½ºÆ®

[Çѱ۷ΠÁ¤·Ä] [ A S a b c d e f g h i j l m n o p r s t u v w ]

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