Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8
Date tag: February 4 2010 5:20:53
Yak shaving
Date tag: February 4 2010 5:20:45
Click here to add notes.
Date tag: February 4 2010 5:15:11
Pez dispenser
Date tag: February 4 2010 5:10:56
ADTs A data container with well defined or recognizable behavior. Each operation has a signature, a pre condition, and a post condition. stack, queue, priority queue, dequeue. The idea of the stack was developed by prof Fritz Baver.
Date tag: February 2 2010 6:19:14
Example ADTs include a stack, a queue, a set, vectors or a dictionary. There may be multiple ways to interpret a given ADT but the meaning is the same regardless. Often programming languages supply a way to put a hard interface around a user defined ADT.
Date tag: February 2 2010 6:15:36
Each operation has a signature which describes the parameters and their types possibly. Also they have a precondition that states what must be true before the function is called and a postcondition that describes the effect of the opearation in terms of the parameters and global state.
Date tag: February 2 2010 6:15:22
ADTs: An abstract data type is a structure that has well defined and recognizable behavior. It contains data that may only be accessed in a prescribed manner by a set of named operations.
Date tag: February 2 2010 6:10:42
This example illustrates a pretty big idea: A single function implements several versions of itself and selects the appropriate definition to use based on the kind of object passed to it. This is called polymorphism and is central to object oriented programming.
Date tag: February 2 2010 6:7:43
Click here to add notes.
Date tag: February 2 2010 6:1:2
Click here to add notes.
Date tag: February 2 2010 5:56:45
Click here to add notes.
Date tag: February 2 2010 5:50:8
Click here to add notes.
Date tag: February 2 2010 5:49:44
Click here to add notes.
Date tag: February 2 2010 5:38:40
Structs: Like c, c plus plus, scheme supports the definition of structs for user defined structured data. Lets define a simple struct type that models points on a cartesian plane.
Date tag: February 2 2010 5:33:30
Click here to add notes.
Date tag: February 2 2010 5:33:20
Click here to add notes.
Date tag: February 2 2010 5:33:2
Click here to add notes.
Date tag: February 2 2010 5:27:6
Click here to add notes
Date tag: February 2 2010 5:21:12
Click here to add notes.
Date tag: February 2 2010 5:20:59
Click here to add notes.
Date tag: February 2 2010 5:13:38
Click here to add notes.
Date tag: February 2 2010 5:13:23
A Higher order function is a function that takes another function as one of its parameters. Function composition using higher order functions is a fundamental technique in functional programming. Object oriented programming takes a different approach using inheritance and polymorphism or overloading. Procedural languages can use HOFs using function pointers.
Date tag: February 2 2010 5:5:22
Click here to add notes.
Date tag: February 2 2010 5:4:57
define my filter scheme
Date tag: January 28 2010 6:20:6
A higher order functions, HOF, is a function that takes another function as an argument, eg myfilter. HOFs are key to advanced functional programming.
Date tag: January 28 2010 6:17:44
Click here to add notes.
Date tag: January 28 2010 6:13:55
Click here to add notes.
Date tag: January 28 2010 6:11:3
Click here to add notes.
Date tag: January 28 2010 6:10:50
Click here to add notes.
Date tag: January 28 2010 6:8:14
Functional abstraction and higher order functions in scheme.
Date tag: January 28 2010 6:4:4
Click here to add notes.
Date tag: January 28 2010 6:2:11
Click here to add notes.
Date tag: January 28 2010 5:52:39
Click here to add notes.
Date tag: January 28 2010 5:48:34
Click here to add notes.
Date tag: January 28 2010 5:44:23
Click here to add notes.
Date tag: January 28 2010 5:39:57
Click here to add notes.
Date tag: January 28 2010 5:34:50
So far, all functions have been invoked by their names, but lists can be functions too.
Date tag: January 28 2010 5:29:12
Functions dont actually need names, although it is convenient to name them. Recall that some sexprs have values such as atoms, lists, functions applications, and special forms.
Date tag: January 28 2010 5:29:3
Click here to add notes.
Date tag: January 28 2010 5:23:33
The local construct is not in official scheme bit it is defined in the teaching exercise we use.
Date tag: January 28 2010 5:23:22
Click here to add notes.
Date tag: January 28 2010 5:15:55
Local definitions. The idea is to create local variables and functions that dont exist outside of this scope. Each definition is a local constant or function definition.
Date tag: January 28 2010 5:15:45
Like most programming languages, Scheme uses lexical, aka static, scoping to resolve the meanings of variables references. Look where a variable or function is used and work up through the program structure, towards the global namespace, but stop when you find a match.
Date tag: January 28 2010 5:15:37
So far we have used define to create constants and functions in the global namespace. Sometimes we would like to be able to create temporary local definitions that exist only inside a function without polluting the global namespace.
Date tag: January 28 2010 5:7:21
Click here to add notes.
Date tag: January 26 2010 6:19:6
Click here to add notes.
Date tag: January 26 2010 6:16:43
Click here to add notes.
Date tag: January 26 2010 6:12:13
Click here to add notes.
Date tag: January 26 2010 6:0:57
Click here to add notes.
Date tag: January 26 2010 6:0:22
Click here to add notes.
0 1 2 3 4 5 6 7 8