→ Week 3 Pattern Matching A Recursion → Öğrenmeye Başla / MP3 Flashcards indir

soru		cevap
functions use what kind of notation? öğrenmeye başla		Prefix eg mod n 2
operatoes use what kind of notation? öğrenmeye başla		infix eg 2 * 3
define pattern matching öğrenmeye başla		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? öğrenmeye başla		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