Creating the set of all possible subsets, the powerset of a set with Scheme.
Redirecting the input output stream using the << symbol in the c or bash shell. This is useful when you wish to run another program that is initialized in the shell through a command.
Example environment diagrams in Scheme.
Message passing is the underlying theme of object oriented programming. Data directed programming uses tagged-data.
Pollards algorithm can be used to factor huge numbers.
Y-combinator is a way of defining a function that can call itself without the define function.
This demonstrates a mathematical concept of a perfect number in a computational abstraction utilizing scheme.
Implementing tree recursion with Scheme.
Distinguishable and Indistinguishable boxes and objects. Combinations and permutations. Placing objects into boxes.
Using scheme to compute derivatives and integrals.
Creating a vector-filter function without the use of lists as an intermediate value.
How to create a vector append procedure in Scheme.
Return the path of a given element within a tree.
Utilizing environments to make classes and objects.
Binary trees, binary search trees, and algorithms for searching these trees.
Reversing a list in scheme using iterative and recursive processes.
The Euclidean Algorithm is used to find the Greatest Common Divisor. Written in Scheme.
How to compute a base b expansion of a number n.
Modular Exponentiation is an important algorithm in cryptography and computer science.
Recursive string substitutions in lists in Scheme.