Interface | Description |
---|---|
Function.HasInverse |
A Function, f, might have an inverse() Function.
|
Value.Scannable |
A class that implements Scannable can produce (by toSeries()) a
Series of Values. |
Class | Description |
---|---|
Declaration |
Declaration specifies the abstract syntax (parse tree) of
|
Environment |
Semantically,
|
Expression |
Class Expression defines the abstract-syntax
(i.e., parse tree) of Expressions in the language;
also see
Value . |
Expression.Application |
A Function application (e1 e2), where
e1 must evaluate to a
Function . |
Expression.Binary |
(e1 op e2); yes it's just a
special kind of
Expression.Application . |
Expression.Block |
let <
Decs > in e. |
Expression.Const | |
Expression.Ident | |
Expression.IfExp |
(if e1 then e2 else e3); yes it's
just a special kind of
Expression.Application -- of
cond = \x1.\x2.\x3.x1 x2 x3 |
Expression.LambdaExp |
λ x.e denotes a
Function . |
Expression.Tuple |
(e0, e1, ...); also see
Value.Tuple . |
Expression.Unary |
(op e); yes it's just a
special kind of
Expression.Application . |
FP |
Wrapper for the interpreter, bringing Syntax and Semantics together.
|
FPapplet | |
Function |
The class of Functions; note that a Function is a
Value . |
Function.Cts2Cts |
The class of Cts → Cts Functions.
|
Function.Cts2Cts.WithInverse |
This class exists so that one can create an anonymous
Cts2Cts which (implements)
HasInverse . |
Function.Cts2Cts2Cts |
Curried continuous functions,
R→R→R or more correctly
Cts→Cts→Cts. |
Function.CtsD2CtsD |
Functions of Vectors of D Continuous Values,
RD→RD.
|
Function.CtsD2CtsD.WithInverse |
Class CtsD2CtsD.WithInverse exists so that one can create an
anonymous
CtsD2CtsD which implements
HasInverse . |
Function.Native | |
Function.Native.WithInverse |
This class exists so that one can create an anonymous
Function.
Native which (implements)
HasInverse . |
Function.Native2 |
Curried native
Function s specified by
arbitrary Java code in apply2(v0,v1) . |
Function.Native3 |
3-Curried native
Function s specified by
arbitrary Java code in apply3(v0,v1,v2) . |
Function.WithInverse |
This class exists so that one can create an anonymous
Function which (implements)
HasInverse . |
Lexical |
A stateful Lexical analyser, also see
Syntax . |
Library | |
Library.Power |
EXPERIMENTAL, The class of Cts2Cts Functions,
Power(c,p)(x)=c.xp.
|
README |
About package 'la.la' — LA's implementation
of the λ-calculus.
|
Syntax |
The parser, also see
Lexical and Expression . |
Type |
The Types of
Values ;
it is for a very simple dynamic type system;
Type.Enum and Type.Option are interesting. |
Type.Atomic | |
Type.Char |
The class of the
CHAR Type. |
Type.Cts |
The class of the
CTS Type. |
Type.Discrete |
The superclass of Discrete Types.
|
Type.Enum |
Enum Types, e.g., DNA={A,C,G,T}, types of
Value.Enum . |
Type.Function |
Function Types.
|
Type.Int |
The class of the
INT Type. |
Type.Model |
Model Types.
|
Type.Option |
Option Types, e.g.,
Value.List : Type.LIST ,Type.Enum . |
Type.Structured |
Superclass of
Type.Vector etc; also see Type.Atomic . |
Type.Triv |
The class of the
TRIV Type. |
Type.Tuple |
The Types of k-Tuples; there is a different type for each value of k.
|
Type.Tuple.GP |
A Tuple Type with specific field Types,
Type.Tuple.GP.elts . |
Type.TYPE |
The class of the Type of a Type; see
TYPE . |
Type.Vector | |
Value |
Value = int + bool + char + triv + ... |
Value.Atomic | |
Value.Bool |
Bool = false | true; also see
Type.BOOL . |
Value.Char |
A Char Value; also see
Type.CHAR . |
Value.Chars |
A Chars (String) Value; also see
Type.CHARS . |
Value.Cts | |
Value.Defer |
The class of lazy, that is, not yet computed, Deferred Values,
Value.Defer.Exp and Value.Defer.App . |
Value.Defer.App |
A lazy, un-apply-ed, Deferred Function-application, a
(Function, actual-parameter)
pair.
|
Value.Defer.Exp |
A lazy unevaluated, Deferred Expression is a closure, (e, r),
a
Expression , Environment ). |
Value.Discrete |
Discrete Values, such as
Value.Bool , are subclasses of Discrete. |
Value.Enum |
Enum Values, for example, A:DNA; also see
Type.Enum . |
Value.Enum.GP |
A basic "general purpose" (GP) implementation of an Enum Value
having a given
Type.Enum t. |
Value.Inc_Or |
Inc_Or t0 t1 = Left t0 | Right t1
| Both t0 t1,
for where one, or both, of v0:t0 and v1:t1 can be present.
|
Value.Inc_Or.Both |
Both v0 v1.
|
Value.Inc_Or.Left |
Left v0, the first (Left) Option alone.
|
Value.Inc_Or.Right |
Right v1, the second (Right) Option alone.
|
Value.Int |
Also see
Type.INT . |
Value.Lambda |
Function produced from a
Expression.LambdaExp and an
Environment . |
Value.List |
Linked Lists, a special implementation of the abstract
Value.Option . |
Value.List.Cell |
A List Cell; also see
Value.List.NIL . |
Value.Maybe | |
Value.Maybe.Just |
The Value is present, Just v.
|
Value.Option |
An Option Value has a "tag",
Value.Option.n() , and zero or more
sub-Values, Value.Structured.elt(int) depending on the tag. |
Value.Option.GP |
A general purpose (GP) implementation of an
Value.Option Value;
also see Type.Option , and Value.List . |
Value.Real |
A class of exact
Value.Cts Values -- those having
. |
Value.Structured | |
Value.Triv |
() : . |
Value.Tuple |
The class of heterogeneous k-Tuples, that is pairs, triples,
and so on; also see
Type.Tuple and Vector . |
Value.Tuple.GP |
A simple general purpose (GP) implementation of a Tuple Value.
|
README
.