Basic K
=======

lecture     9-10, 10:30-12
practice:   1:30-

practice consists of Q+A, exercises, problem-solving

====================================================

Day 1:
-----
0)	concepts
    -   the array language tradition:  k and arthur whitney.
    -   the k user and reference manuals
    -   e = k+
    -   e = k- (no gui)

1)	operation
    -   start e
    -   2+2
    -   \ is help
    -   \\ to quit
    -   scripts
    -	/<comment> is comment
    -   \l <script>

2)	data
    -	assignment:  name:value
    -	datatypes: int, float, char, symbol, dictionary, nil, function, 64bit (4:)
    -	atoms
    -	lists and numeric indexing (vectors)
    -	dictionaries and symbolic indexing
    -   lambdas and application
    -   . and @ as functional forms of bracket indexing and application

Day 2:
-----
3)	read/write:  0: 1: 5: 6:

4)	verbs
    ambivalence
    -   20 monads, 20 dyads
    -	read left-to-right, execute right-to-left
    -	punctuation and grouping
    math: + - * % ^ & |
    logic: > < = ~
    structure: , # _ ! &
    errors: index, domain, length, value

5)	adverbs
    / \ '
    /: \: ':

Day 3:
-----
6)	user-defined functions
    -	function returns the value of the last expression
    -	default arguments [x;y;z]
    -	control structures if :[] while do return : signal ‘
    -   console debugger
    -	suspension, abort \ resume : signal ‘ - examine locals
    -	recursion: fac:{:[x>1;x*_f x-1;1]}
    -   projection
    -   composition
    -   scope

7)  system functions

Day 4:
-----
8)  the k tree
    -	\d \v
    -	dependency
    -	trigger

9)  ipc (3: 4: .m.g .m.s .m.u .m.c _h _u _w _p)

10) dot: . x, .(x;y), .(x;y;z), .(x;y;z;w)

Day 5:
-----
10) style
11) e
12) classical examples (nsl.com/k/a)
13) idioms
14) joel kaplan (https://www.youtube.com/watch?v=Ni0Kj3Xjk1k&t=49s)