The Algebraic Metalanguage
 
 
 
 
 
 
Go to file
Mike Gerwitz 8735c2fca3 tamer: asg::graph: Static- and runtime-enforced multi-kind edge ontolgoy
This allows for edges to be multiple types, and gives us two important
benefits:

  (a) Compiler-verified correctness to ensure that we don't generate graphs
      that do not adhere to the ontology; and
  (b) Runtime verification of types, so that bugs are still memory safe.

There is a lot more information in the documentation within the patch.

This took a lot of iterating to get something that was tolerable.  There's
quite a bit of boilerplate here, and maybe that'll be abstracted away better
in the future as the graph grows.

In particular, it was challenging to determine how I wanted to actually go
about narrowing and looking up edges.  Initially I had hoped to represent
the subsets as `ObjectKind`s as well so that you could use them anywhere
`ObjectKind` was expected, but that proved to be far too difficult because I
cannot return a reference to a subset of `Object` (the value would be owned
on generation).  And while in a language like C maybe I'd pad structures and
cast between them safely, since they _do_ overlap, I can't confidently do
that here since Rust's discriminant and layout are not under my control.

I tried playing around with `std::mem::Discriminant` as well, but
`discriminant` (the function) requires a _value_, meaning I couldn't get the
discriminant of a static `Object` variant without some dummy value; wasn't
worth it over `ObjectRelTy.`  We further can't assign values to enum
variants unless they hold no data.  Rust a decade from now may be different
and will be interesting to look back on this struggle.

DEV-13597
2023-01-26 14:45:14 -05:00
bin Copyright year and name update 2023-01-20 23:37:30 -05:00
build-aux Copyright year and name update 2023-01-20 23:37:30 -05: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 rater/tame: Remove circular symlink 2022-05-12 14:32:24 -04:00
src Copyright year and name update 2023-01-20 23:37:30 -05:00
tamer tamer: asg::graph: Static- and runtime-enforced multi-kind edge ontolgoy 2023-01-26 14:45:14 -05: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): Re-add tamer/target/doc 2022-09-20 09:52:42 -04:00
.gitmodules Documentation and testing scaffolding 2015-04-16 13:21:22 -04:00
.rev-xmle TAMER: Separate static xmle section 2020-02-26 10:49:01 -05: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.