Mike Gerwitz

Activist for User Freedom

aboutsummaryrefslogtreecommitdiffstats
blob: fe2fce451a820231427a2b4c065e457778154aec (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
@c  This document is part of the TAME manual.
@c  Copyright (C) 2014-2020 Ryan Specialty Group, LLC.
@c    Permission is granted to copy, distribute and/or modify this document
@c    under the terms of the GNU Free Documentation License, Version 1.3 or
@c    any later version published by the Free Software Foundation; with no
@c    Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
@c    A copy of the license is included in the section entitled ``GNU Free
@c    Documentation License''.

@node Core Concepts
@chapter Core Concepts
@helpwanted

@cindex declarative, programming
@cindex imperative, programming
@tame is a @dfn{declarative} programming language@mdash{
  }it @emph{describes} how a program ought to behave rather than
    explicitly telling a computer the steps needed to make it work
    (@dfn{imperative}).
@tame is a calculator at heart,
  so code written in its language describes mathematical operations.
Definitions fall primarily under two categories:

@table @strong
  @cindex classifications
  @item Classifications
  Higher-order logic used to classify data and predicate calculations,
    controlling program flow.

  @cindex calculations
  @item Calculations
  Mathematical operations motivated by linear algebra.
@end table

@tame also supports abstracting calculations into @dfn{functions},
  which permits the use of recursion for solving problems that are
  difficult to fit into an algebraic model.
The language is Turing-complete.

@cindex metalanguage
@cindex domain-specific language
@tame itself is a @dfn{domain-specific language} (DSL)@mdash{
  }it was designed for use in comparative insurance rating systems.
However,
  it couldn't possibly know all useful abstractions that may be needed
    in the future;
      the domain for which @tame was designed encompasses many
      subdomains as well.
To accommodate future needs,
  @tame is also a @dfn{metalanguage}@mdash{
    }a language that can be used to program itself.
The core language is based upon broad mathematical foundations
  that offer great flexibility.
Its expressive template system allows the creation of abstractions
  that are indistinguishable from core language features,
    and templates have powerful introspective capabilities that allow
    for many useful types of code generation.
Essentially,
  @tame allows the creation of sub-DSLs.

Code is written in @tame without regard to order of execution@mdash{
  }the linker will figure that out for you.
This simplifies the development of systems with complex graphs of
  dependencies.

@todo{This chapter is a placeholder.
      More to come.}