
################################################################################
Compilers DICT
################################################################################

Key terms for the matheology compilation system.


.. glossary::
   :sorted:

   SISYF
      :bu:`S`\ *ystems* :bu:`I`\ *ntegrating* :bu:`S`\ *ystem* :bu:`Y`\ *ielding* :bu:`F`\ *ormalisms*

      The cross-model compiler for matheology. SISYF reads PoR source files
      across all models (PET, JUB, ...) and produces audience-specific
      downstream pages (expert, easy, producer, math, machine). Like
      Sisyphus, who pushes his boulder up the hill again and again, SISYF
      must redo the work every time the source changes. And like Sisyphus,
      SISYF never changes the boulder --- it only moves it. Source data is
      strictly read-only.

      **Safety:** Read-only with respect to source data. Recovery uses
      Bouldr (SISYF's built-in rollback).

      See :ref:`compiler-sisyf` for details.

   PROMY
      :bu:`P`\ *urifying* :bu:`R`\ *ewriting* :bu:`O`\ *rchestrating* :bu:`M`\ *atheological* :bu:`Y`\ *ields*

      The intra-model reasoning compiler for matheology. PROMY works
      within a single model, integrating HELL evidence (cons, pros,
      findings) to evolve axioms, theorems, and other elements. Named
      after Prometheus, whose liver is eaten by an eagle every day and
      regrows overnight --- because HELL evidence continually exposes
      flaws that must be purified and rewritten, and the cycle repeats
      as the model grows.

      **Safety:** Read-write with respect to source data. Inherently
      dangerous --- requires version control, human review gates, and
      append-only audit trails.

      See :ref:`compiler-promy` for details.
