All Classes
-
All Classes Interface Summary Class Summary Enum Summary Exception Summary Class Description Applicable A compiled expression that can be evaluated by applying to an argument.ApplyType Type that is a polymorphic type applied to a set of types.Ast Various sub-classes of AST nodes.Ast.Aggregate Call to an aggregate function in acompute
clause.Ast.AnnotatedExp Parse tree node of an expression annotated with a type.Ast.AnnotatedPat Pattern that is a pattern annotated with a type.Ast.Apply Application of a function to its argument.Ast.Case Case expression.Ast.CompositeType Not really a type, just a way for the parser to represent the type arguments to a type constructor.Ast.Con0Pat Type constructor pattern with no argument.Ast.ConPat Type constructor pattern with an argument.Ast.DatatypeBind Parse tree node of a datatype binding.Ast.DatatypeDecl Parse tree node of a datatype declaration.Ast.Decl Base class for declarations.Ast.Exp Base class of expression ASTs.Ast.Fn Lambda expression.Ast.From From expression.Ast.FunBind One of the branches (separated by 'and') in a 'fun' function declaration.Ast.FunctionType Function type.Ast.FunDecl Parse tree node of a function declaration.Ast.FunMatch One of the branches (separated by '|') in a 'fun' function declaration.Ast.Id Parse tree node of an identifier.Ast.IdPat Named pattern, the pattern analog of theAst.Id
expression.Ast.If "If ...Ast.InfixCall Call to an infix operator.Ast.InfixPat Pattern build from an infix operator applied to two patterns.Ast.LetExp "Let" expression.Ast.List List.Ast.ListPat List pattern, the pattern analog of theAst.List
expression.Ast.Literal Parse tree node of a literal (constant).Ast.LiteralPat Literal pattern, the pattern analog of theAst.Literal
expression.Ast.Match Match.Ast.NamedType Parse tree for a named type (e.g.Ast.Pat Base class for a pattern.Ast.PrefixCall Call to an prefix operator.Ast.Record Record.Ast.RecordPat Record pattern.Ast.RecordSelector Parse tree node of a record selector.Ast.RecordType Parse tree node of a record type.Ast.Tuple Tuple.Ast.TuplePat Tuple pattern, the pattern analog of theAst.Tuple
expression.Ast.TupleType Tuple type.Ast.TyCon Type constructor.Ast.Type Base class for parse tree nodes that represent types.Ast.TyVar Parse tree node of a type variable.Ast.ValBind Value bind.Ast.ValDecl Parse tree node of a value declaration.Ast.WildcardPat Wildcard pattern.AstBuilder Builds parse tree nodes.AstNode Abstract syntax tree node.AstWriter Context for writing an AST out as a string.Binding Binding of a name to a type and a value.BuiltIn Built-in constants and functions.CalciteForeignValue Value based on a Calcite schema.Closure Value that is sufficient for a function to bind its argument and evaluate its body.Code A compiled expression, that can be evaluated.Codes Helpers forCode
.Codes.TupleCode A code that evaluates expressions and creates a tuple with the results.CompiledStatement Statement that has been compiled and is ready to be run from the REPL.CompileException An error occurred during compilation.Compiler Compiles an expression to code that can be evaluated.Compiles Helpers forCompiler
andTypeResolver
.ConsList<E> List that consists of a head element and an immutable non-empty list.DataType Algebraic type.DummyType Type that is a place-holder for a type constructor that has no arguments; for example, "NONE" in "datatype 'a option = NONE | SOME of 'a" would have dummy type.Environment Environment for validation/compilation.Environments Helpers forEnvironment
.EvalEnv Evaluation environment.EvalEnvs Helpers forEvalEnv
.FnType The type of a function value.ForallType Universally quantified type.ForeignValue External value.ListType The type of a list value.Macro A function that is 'called' at compile time, and generates an expanded parse tree.Main Standard ML REPL.MapList<E> Read-only list that generates elements between 0 andsize
- 1 by applying a function.MartelliUnifier Unification algorithm due to Martelli, Montanari (1976) and Paterson, Wegman (1978).MutableEvalEnv An evaluation environment whose last entry is mutable.NamedType Type that has a name.Op Sub-types ofAstNode
.Ord<E> Pair of an element and an ordinal.Ord.IntObjObjConsumer<K,V> Consumer that receives an ordinal, a key, and a value.Pair<T1,T2> Pair of objects.Pair.PairWithOrdinalConsumer<K,V> Represents an operation that accepts two input arguments and an ordinal, and returns no result.Pos Position of a parse-tree node.PrimitiveType Primitive type.RecordType The type of a record value.RelList A list whose contents are computed by evaluating a relational expression.RobinsonUnifier Robinson's unification algorithm.Shell Command shell for ML, powered by JLine3.Shuttle Visits and transforms syntax trees.Static Utilities.TailList<E> A dynamic list that reads from a given point in a backing list.TupleType The type of a tuple value.Type Type.TypeResolver Resolves the type of an expression.TypeResolver.Resolved Result of validating a declaration.TypeResolver.TypeMap The result of type resolution, a map from AST nodes to types.TypeSystem A table that contains all types in use, indexed by their description (e.g.TypeSystem.ForallHelper Provides access to type variables from within a call toTypeSystem.forallType(int, Function)
.TypeSystem.TemporaryType Placeholder for a type that is being recursively defined.TypeVar Type variable (e.g.TypeVisitor<R> Visitor overType
objects.Unifier Given pairs of terms, finds a substitution to minimize those pairs of terms.Unifier.Action Called by the unifier when a Term's type becomes known.Unifier.Failure Result indicating that unification was not possible.Unifier.Result Result of attempting unification.Unifier.Sequence A sequence of terms.Unifier.Substitution The results of a successful unification.Unifier.Term Term (variable, symbol or node).Unifier.TermTerm A pair of terms.Unifier.TermVisitor<R> Visitor for terms.Unifier.Variable A variable that represents a symbol or a sequence; unification's task is to find the substitutions for such variables.Unit A placeholder value for the "unit" type.