Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
Date tag: January 8 2010 8:41:44
Click here to add notes.
Date tag: January 8 2010 8:41:36
Fixed Point Iteration
Date tag: January 8 2010 8:21:15
Proof tip 0 If you assume what you are trying to prove, then you will get ZERO.
Date tag: January 8 2010 8:19:52
Click here to add notes.
Date tag: January 8 2010 8:18:19
Click here to add notes.
Date tag: January 8 2010 8:15:25
Click here to add notes.
Date tag: January 8 2010 8:13:9
Click here to add notes.
Date tag: January 8 2010 8:12:48
Extended euclidean algorithm
Date tag: January 8 2010 8:3:33
Click here to add notes.
Date tag: January 8 2010 8:3:16
Click here to add notes.
Date tag: January 8 2010 7:57:33
Click here to add notes.
Date tag: January 8 2010 7:51:3
Click here to add notes.
Date tag: January 8 2010 7:44:31
Click here to add notes.
Date tag: January 8 2010 7:44:21
Click here to add notes.
Date tag: January 8 2010 7:42:46
Click here to add notes.
Date tag: January 8 2010 7:37:46
Click here to add notes.
Date tag: January 8 2010 6:21:0
The 2s complement is one greater than the 1s complement
Date tag: January 8 2010 6:19:31
Click here to add notes.
Date tag: January 8 2010 6:19:17
Click here to add notes.
Date tag: January 8 2010 6:14:21
2s complement
Date tag: January 8 2010 6:14:10
Click here to add notes.
Date tag: January 8 2010 6:9:24
Click here to add notes.
Date tag: January 8 2010 6:1:39
Click here to add notes.
Date tag: January 8 2010 5:57:19
Click here to add notes.
Date tag: January 8 2010 5:52:11
Click here to add notes.
Date tag: January 8 2010 5:48:37
Click here to add notes.
Date tag: January 8 2010 5:43:19
Click here to add notes.
Date tag: January 8 2010 5:40:24
Click here to add notes.
Date tag: January 8 2010 5:40:15
Click here to add notes.
Date tag: January 8 2010 5:37:6
Click here to add notes.
Date tag: January 7 2010 6:18:37
Numbers and booleans in Scheme.
Date tag: January 7 2010 6:15:39
If a sexpr is an atom then its value can be the atoms value. A sexpr can also be a function application or a list that is a special form which looks a bit like a function application but is evaluated differently.
Date tag: January 7 2010 6:15:27
Some symbols are special keywords in scheme and have predefined values eg. empty, define, first.
Date tag: January 7 2010 6:12:2
An atom can, but need not, have a value.
Date tag: January 7 2010 6:5:22
Kids make nutritious snacks.
Date tag: January 7 2010 6:5:4
Brocolli is often blind. Green ideas sleep furiously.
Date tag: January 7 2010 6:2:0
The syntax of a language defines the set of legal structures. The semantics of a language gives meaning to the same syntactially valid constructs.
Date tag: January 7 2010 5:57:22
Date tag: January 7 2010 5:50:55
A symbol is just about any set of consecutive chars that are not string or numerical constants and are made up of these characters...
Date tag: January 7 2010 5:50:49
An atom is one of, an explicit numeric constant value, an explicit constant string value, or a symbol.
Date tag: January 7 2010 5:48:56
The fundamental construct in Scheme is the symbolic expression or sexpr. Syntactically a sexpr is an atom, a list, or other stuff such as a struct.
Date tag: January 7 2010 5:40:45
Click here to add notes.
Date tag: January 7 2010 5:36:12
Executing a functional program means evaluation an expression. Most functional languages have an interactive runtime environment that can execute your program one line at a time. This is called a REPL, read eval print loop.
Date tag: January 7 2010 5:31:42
An expression is something that has a value and can be evaluated. A statment is a, possibly compound, task.
Date tag: January 7 2010 5:24:49
A side effect is a change to the global state, including input or output. They are central to the imperative programs. In functional programming, we try to avoid them as much as possible. Exceptions include function or constant definitions, read or write, or mutation.
Date tag: January 7 2010 5:24:42
In programming the domain is the arguments plus the global state. The range is the return type. In imperative languages void functions are excluded because they have interesting side effects.
Date tag: January 7 2010 5:24:30
What is a function
Date tag: January 7 2010 5:24:22
Imperative versus functional programming. Examples of imperative languages are C, C plus plus, Java, and Python. In imperative programs are a sequence of statements. Each statement is a task. Examples of functional languages are scheme, LISP, Haskall.
Date tag: January 6 2010 9:21:12
Click here to add notes.
Date tag: January 6 2010 9:20:51
Click here to add notes.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114