Tom (programming language)¶

A language extension for C and Java that adds algebraic pattern matching, term construction, rewrite rules and programmable rewriting strategies.

Version: v1 · 2026-09-08 · History
Domain-specific #: 7158
Origin domain: programming languages
Subdomain: programming languages

Core Idea¶

Tom is embedded and compiled into host-language code rather than being merely an XML transformer, and its identity depends on its matching and strategic rewriting constructs rather than any one application. Typed algebraic terms are matched against patterns, rewrite rules construct replacement terms and strategy combinators control traversal and rule application before translation into the host language. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application¶

Tom (programming language) belongs to programming languages and is useful where the analyst can specify the typed programming languages carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the host language and compiler pipeline, algebraic signature and term representation, pattern and matching semantics, rewrite rules, strategy language and traversal, typing and interoperability, generated code and confluence termination or execution-order assumptions are explicit. The scope is broad within that domain but bounded by the need for the host language and compiler pipeline, algebraic signature and term representation, pattern and matching semantics, rewrite rules, strategy language and traversal, typing and interoperability, generated code and confluence termination or execution-order assumptions are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the host language and compiler pipeline, algebraic signature and term representation, pattern and matching semantics, rewrite rules, strategy language and traversal, typing and interoperability, generated code and confluence termination or execution-order assumptions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Tom (programming language). Tom (programming language) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed programming languages carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the host language and compiler pipeline, algebraic signature and term representation, pattern and matching semantics, rewrite rules, strategy language and traversal, typing and interoperability, generated code and confluence termination or execution-order assumptions are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of programming languages because they reuse the typed programming languages carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Typed algebraic terms are matched against patterns, rewrite rules construct replacement terms and strategy combinators control traversal and rule application before translation into the host language., and type the carrier, state every parameter and convention in the definition, test that the host language and compiler pipeline, algebraic signature and term representation, pattern and matching semantics, rewrite rules, strategy language and traversal, typing and interoperability, generated code and confluence termination or execution-order assumptions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Tom (programming language) Domain-specific

Parents (1) — more general patterns this builds on

Tom (programming language) is a kind of Transformation Prime

The proposed strict upward parent is prime:transformation.

Hierarchy path (1) — routes to 1 parentless root

Tom (programming language) → Transformation → Function (Mapping)

Neighborhood in Abstraction Space¶

Tom (programming language) sits in a crowded region of the domain-specific corpus (12^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Programming Languages & Runtime Types (21 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08