→ Week 3 Pattern Matching A Recursion → Start Learning / Flashcards Téléchargement MP3

question		réponse
functions use what kind of notation? commencer à apprendre		Prefix eg mod n 2
operatoes use what kind of notation? commencer à apprendre		infix eg 2 * 3
define pattern matching commencer à apprendre		checking a given sequence of tokens for the presence of the constituents of some pattern eg (\|\|): Bool -> Bool -> Bool /n True \|\| _ = True /n False \|\| a = a
what is a recursive definition? commencer à apprendre		one that is defined in terms of its self eg fact: Int -> Int /n fact n /n \| n > 0 = n * fact (n - 1) /n \| n == 0 = 1 /n \| otherwise = error "undefined for neg ints"

Week 3 Pattern matching a recursion