¹ø¿ª ¿ë·Ê
:
¿µ¾î Àü°ø ´Ü¾î¸¦ Çѱ۷Π¹ø¿ªÇÑ ¿¹µéÀÔ´Ï´Ù. ÁÁÀº ¿¹µéÀ» µî·ÏÇØ Áֽʽÿä.
ÇÁ·Î±×·¡¹Ö ¾ð¾î ¹× ÇÁ·Î±×·¡¹Ö ½Ã½ºÅÛ
ºÐ¾ßÀÔ´Ï´Ù.
µî·ÏµÈ ¿¹µéÀº 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