The Algebraic Metalanguage
 
 
 
 
 
 
Go to file
Mike Gerwitz 7c9d6837fe Improve runner reload stability
The `tame` client has the ability to request a runner reload by issuing
SIGHUP to the runner PID.  This will cause `tamed` to kill the runner and
respawn it.

There were situations where this process hung or did not operate as
expected; the process was not reliable.  This does a number of things to
make sure the process is in a good state before proceeding:

  1. The HUP trap is set a single time, rather than being reset each time
     the signal is received for the runner.
  2. A `reloading` flag is set by the `tame` client when reloading is
     requested, and the flag is cleared by `tamed` when spawning a new
     runner.  This allows the client to wait until the reload is complete,
     and bail out otherwise.  Without this, there is a race, where the
     client may proceed to issue additional requests before the original
     runner terminates.
  3. Kill the runner with SIGKILL (signal 9).  This gives no opportunity for
     the runner to ignore the signal, and gives us confidence that the
     runner is actually going to be killed.

This may have caused errors that look like this (where 129 is the HUP
reload, which is expected):

  warning: failed runner 0 ack; requesting reload
  warning: runner 0 exited with code 129; restarting
  error: runner 0 still unresponsive; giving up

The last line may also be omitted, with instead an empty `xmlo` being
generated.

DEV-10806
2023-10-03 14:14:47 -04:00
bin Improve runner reload stability 2023-10-03 14:14:47 -04:00
build-aux build-aux/Makefile.am: Introduce .experimental files 2023-06-14 12:02:57 -04:00
core Copyright year and name update 2023-01-20 23:37:30 -05:00
design/tpl Copyright year and name update 2023-01-20 23:37:30 -05:00
doc Copyright year and name update 2023-01-20 23:37:30 -05:00
progtest Copyright year and name update 2023-01-20 23:37:30 -05:00
rater tame: rater.xsd: templateName: Permit multiple leading/trailing underscores 2023-04-12 14:54:00 -04:00
src preproc/domain: Eliminate duplicate domain generation 2023-09-28 10:21:52 -04:00
tamer tamer: asg: Require that all template parameters be referenced in body 2023-09-19 15:58:33 -04:00
test Copyright year and name update 2023-01-20 23:37:30 -05:00
tools Copyright year and name update 2023-01-20 23:37:30 -05:00
.gitignore design/tpl: The Tame Programming Language initial concept 2021-05-10 13:46:49 -04:00
.gitlab-ci.yml .gitlab-ci.yml: build: Clean before build 2023-05-19 13:43:41 -04:00
.gitmodules Documentation and testing scaffolding 2015-04-16 13:21:22 -04:00
.rev-xmle tamer: Remove {ret}map:___{head,tail} 2023-04-30 15:06:47 -04:00
.rev-xmlo current/compiler/worksheet: Generate lv:package/@name 2022-05-26 10:20:05 -04:00
COPYING Initial repository setup 2015-04-14 05:35:36 -04:00
COPYING.FDL Initial repository setup 2015-04-14 05:35:36 -04:00
HACKING Copyright year and name update 2023-01-20 23:37:30 -05:00
Makefile.am Copyright year and name update 2023-01-20 23:37:30 -05:00
README.md Copyright year update 2022 2022-05-03 14:14:29 -04:00
RELEASES.md RELEASES.md: Update for v19.1.0 2022-09-22 12:23:13 -04:00
VERSION.in Add generated VERSION 2016-08-23 11:33:51 -04:00
bootstrap Copyright year and name update 2023-01-20 23:37:30 -05:00
c1map.xsd c1map.xsd: Add schema 2017-07-05 13:51:28 -04:00
configure.ac Copyright year and name update 2023-01-20 23:37:30 -05:00
package-lock.json package{,-lock}.json additions 2020-08-19 15:39:50 -04:00

README.md

TAME

TAME is The Algebraic Metalanguage, a programming language and system of tools designed to aid in the development, understanding, and maintenance of systems performing numerous calculations on a complex graph of dependencies, conditions, and a large number of inputs.

This system was developed at Ryan Specialty Group (formerly LoVullo Associates) to handle the complexity of comparative insurance rating systems. It is a domain-specific language (DSL) that itself encourages, through the use of templates, the creation of sub-DSLs. TAME itself is at heart a calculator—processing only numerical input and output—driven by quantifiers as predicates. Calculations and quantifiers are written declaratively without concern for order of execution.

The system has powerful dependency resolution and data flow capabilities.

TAME consists of a macro processor (implementing a metalanguage), numerous compilers for various targets (JavaScript, HTML documentation and debugging environment, LaTeX, and others), linkers, and supporting tools. The input grammar is XML, and the majority of the project (including the macro processor, compilers, and linkers) is written in a combination of XSLT and Rust.

TAMER

Due to performance requirements, this project is currently being reimplemented in Rust. That project can be found in the tamer/ directory.

Documentation

Compiled documentation for the latest release is available via our GitLab mirror, which uses the same build pipeline as we do on our internal GitLab instance. Available formats are:

Getting Started

To get started, make sure Saxon version 9 or later is available and its path set as SAXON_CP; that the path to hoxsl is set via HOXSL; and then run the bootstrap script:

$ export SAXON_CP=/path/to/saxon9he.jar
$ export HOXSL=/path/to/hoxsl/root

$ ./boostrap

Running Test Cases

To run the test cases, invoke make check (or its alias, make test).

Testing Core Features

In order to run tests located at core/test/core/**, a supporting environment is required. (e.g. mega rater). Inside a supporting rater, either check out a submodule containing the core tests, or temporarily add them into the submodule.

Build the core test suite summary page using:

$ make rater/core/test/core/suite.html

Visit the summary page in a web browser and click the Calculate Premium button. If all test cases pass, it will yield a value of $1.

Hacking

Information for TAME developers can be found in the file HACKING.

License

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.