This package contains some examples of the utilization of
JEOPS. At this version, there are three example applications
to demonstrate some features of JEOPS:
- Fibonacci Series
- The famous series is easily solved through JEOPS. For
those who don't remember, the series is defined
recursively as Fib(0) = 0, Fib(1) = 1, and Fib(n) =
Fib(n-1) + Fib(n-2), for n > 1. This example shows
JEOPS power in handling recursive functions.
- Towers of Hanoi
- The problem of the towers of hanoi, where several
discs have to be moved from one pin to another, in
a 3-pin surface.
- Strings
- A simple example of string manipulation in JEOPS.
Designed more for testing purposes.