Existentially Constrained Terms in Formal Systems

• Existentially constrained terms are constructs defined by the need for admissible witnesses that satisfy explicit constraints, enabling semantic control across diverse formalisms.
• They appear in areas such as formal language theory, logically constrained rewriting, categorical logic, and type systems, often guiding decidability and expressiveness.
• Their applications range from automata theory to proof theory, optimizing structural matching and transformation in programming languages and logical systems.

“Existentially constrained terms” denotes a family of constructions in which a term, expression, judgment, or type is accepted, reducible, typable, or semantically meaningful only when suitable witnesses exist and satisfy explicit constraints. In formal language theory, the witnesses are realizations and possibly interpretations; in logically constrained rewriting, they are value instantiations for logical variables and existentially bound constraint variables; in categorical logic, they are witnesses transported along morphisms by left adjoints $\Sigma_f$; in type theory, they are hidden representations, choice arguments, or existential packages; and in variable-support formalisms, they are exact supports equipped with thinnings. The unifying theme is not a single definition but an existential semantics: one reasons about a term by quantifying over admissible witnesses while controlling how those witnesses may be introduced, hidden, or propagated (Champarnaud et al., 2014, Trotta, 2021, Aoto et al., 29 Jan 2026, Sterling, 2022).

1. Core pattern and major formalisms

A common structural pattern is that the object of interest is not interpreted in isolation. Instead, it is paired with constraints, scopes, types, or supports, and its meaning is given by existence of admissible data satisfying those constraints. In the literature surveyed here, this pattern appears in several technically distinct ways.

Area	Representative form	Existential mechanism
Constrained expressions	$w \in L_I(E)$ or $w \in L(E)$	$\exists r$ and optionally $\exists I$ such that the constraint holds and the word is generated
LCTRSs	$\CTerm{X}{s}{\vec{x}{\varphi}}$	$\exists$ value instantiations respecting an existential constraint
Doctrines	$\Sigma_f(\alpha)$	existential pushforward along a morphism $f$
Type systems	$\bar{\exists}$, $w \in L_I(E)$0, $w \in L_I(E)$1	hidden witnesses, choice witnesses, or reflective packages
Variable-support syntax	$w \in L_I(E)$2	$w \in L_I(E)$3 and $w \in L_I(E)$4 giving exact support

In "Constrained Expressions and their Derivatives" (Champarnaud et al., 2014), regular expressions are extended by boolean constraints over terms, and a word belongs to the denoted language when there exists a realization, and possibly an interpretation, satisfying the embedded formula. In "The existential completion" (Trotta, 2021), existential structure is given by left adjoints $w \in L_I(E)$5 to reindexing, so predicates are pushed forward along terms viewed as morphisms. In the LCTRS line of work, existentially constrained terms are explicit triples whose instances are sets of value-instantiated terms satisfying existential constraints (Aoto et al., 29 Jan 2026, Takahata et al., 28 May 2025). In type-theoretic settings, existential constraints appear as existential packages, polymorphic contexts, type-guarded existentials, or reflective first-class modules (Swierstra et al., 2016, Burn et al., 2017, Sterling, 2022). In co-de-Bruijn syntax, existential content is carried by exact supports and thinnings, so every retained variable occurs somewhere and every discarded variable is absent (McBride, 2018).

This suggests that the phrase is best understood as a semantic pattern rather than a single object language. What varies is the carrier—words, terms, predicates, types, or scopes—while the invariant is existential control over admissible witnesses.

2. Constrained expressions and existential language semantics

In "Constrained Expressions and their Derivatives" (Champarnaud et al., 2014), constrained expressions are regular expressions extended by two operators: $w \in L_I(E)$6 They are defined in an expression environment $w \in L_I(E)$7, where $w \in L_I(E)$8 is the symbol alphabet, $w \in L_I(E)$9 a variable alphabet, $w \in L(E)$0, and concatenation “$w \in L(E)$1” belongs to $w \in L(E)$2. Terms are built from variables and function symbols, boolean formulae are built from predicate symbols and boolean operators, and evaluation depends on an interpretation $w \in L(E)$3 with domain $w \in L(E)$4 together with a realization $w \in L(E)$5 extended to $w \in L(E)$6.

The language semantics is given in three layers. First, with both interpretation and realization fixed, one has $w \in L(E)$7. Then

$w \in L(E)$8

Accordingly, $w \in L(E)$9 means there exists a realization $\exists r$0 such that the constraints hold and $\exists r$1 is generated; $\exists r$2 additionally quantifies over interpretations. The operator $\exists r$3 keeps $\exists r$4 if $\exists r$5 evaluates to true and yields $\exists r$6 otherwise; the operator $\exists r$7 keeps only the single word $\exists r$8 if $\exists r$9 and yields $\exists I$0 otherwise. The paper’s examples make the existential content explicit: under a suitable interpretation of $\exists I$1, the constrained expression

$\exists I$2

denotes $\exists I$3.

A central structural result is the contrast between fixed and varying semantic parameters. For fixed $\exists I$4, constrained expressions denote regular languages via an $\exists I$5-regularization $\exists I$6, and the paper proves

$\exists I$7

Hence membership for fixed $\exists I$8 is polynomially decidable by classical automata methods. By contrast, when either $\exists I$9 or $\CTerm{X}{s}{\vec{x}{\varphi}}$0 varies, $\CTerm{X}{s}{\vec{x}{\varphi}}$1 and $\CTerm{X}{s}{\vec{x}{\varphi}}$2 are unions of regular sets and need not be regular.

Membership in the general case is handled by an extension of Antimirov partial derivatives. Derivation accumulates assumptions as functional, non-crossing substitution sets $\CTerm{X}{s}{\vec{x}{\varphi}}$3, propagates them through expressions and constraints, and reduces word membership to $\CTerm{X}{s}{\vec{x}{\varphi}}$4-membership of derived constrained expressions. The nullability side is then characterized by the indicator set $\CTerm{X}{s}{\vec{x}{\varphi}}$5, whose elements are pairs $\CTerm{X}{s}{\vec{x}{\varphi}}$6 recording variables forced to $\CTerm{X}{s}{\vec{x}{\varphi}}$7 and residual boolean constraints. The decisive theorem states that $\CTerm{X}{s}{\vec{x}{\varphi}}$8 iff there exists $\CTerm{X}{s}{\vec{x}{\varphi}}$9, an interpretation $\exists$0, and a realization $\exists$1 such that $\exists$2.

The decidability frontier is sharp. The paper proves that there exists a fixed interpretation $\exists$3 for which deciding whether $\exists$4 with $\exists$5 is undecidable, yielding undecidable membership when $\exists$6 is fixed. When $\exists$7 is not fixed, satisfiability is decidable via propositionalisation and normalization for non-unary alphabets, and therefore $\exists$8 is decidable. The same formalism thus exhibits strict regularity at fixed $\exists$9, non-regularity under existential variation of realizations or interpretations, and a mixed decidability landscape.

3. Logically constrained rewriting, equivalence, and existential equations

In the LCTRS setting, an existentially constrained term is a triple $\Sigma_f(\alpha)$0, written as $\Sigma_f(\alpha)$1, where $\Sigma_f(\alpha)$2 is a set of logical variables, $\Sigma_f(\alpha)$3 is a term, and $\Sigma_f(\alpha)$4 is an existential constraint whose free variables lie in $\Sigma_f(\alpha)$5 and whose bound variables do not occur in $\Sigma_f(\alpha)$6 (Aoto et al., 29 Jan 2026). Its interpretation is the set of term instances

$\Sigma_f(\alpha)$7

Subsumption and equivalence are defined semantically by quantifying over all $\Sigma_f(\alpha)$8-valued substitutions respecting the source constraint and matching them with $\Sigma_f(\alpha)$9-valued substitutions respecting the target constraint. "Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms" (Takahata et al., 28 May 2025) shows that the original constrained-term equivalence problem embeds faithfully into this setting, and it gives complete characterizations by renaming, by a pattern-general transformation $f$0, and by a more general condition using position-equivalence classes and representative substitutions.

Most general constrained rewriting and partial constrained rewriting separate two notions of existential control (Aoto et al., 29 Jan 2026). For a rule $f$1 and a satisfiable $f$2, a most general redex requires

$f$3

whereas a partial redex requires only satisfiability of

$f$4

The resulting target has term $f$5, constraint $f$6, bound variables $f$7, and logical-variable set $f$8. The difference is semantic and operational: most general rewriting enforces rule constraints for all instances and produces global reducts; partial rewriting progresses for some instances only. The paper proves inclusion of most general steps in partial steps, simulates partial steps by most general steps up to subsumption or equivalence, and introduces value interpretation, in which logical variables are instantiated by values while non-logical variables are only renamed. Value interpretation yields normal-form characterizations distinguishing the existential “there exists a reducible value instance” criterion for partial rewriting from the universal instance-wise condition governing most general rewriting.

"Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations" (Takahata et al., 12 Jul 2025) adds a structural theorem: for left-linear, left-value-free LCTRSs, most general constrained rewriting commutes with equivalence. The paper defines a left-value-free transformation $f$9 moving values from the left-hand side into the rule constraint, proves preservation up to equivalence, and derives a general commutation theorem. A practical consequence is that equivalence transformations may be deferred until after rewrite steps, reducing search-space blow-up in implementations.

"Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting" (Nishida et al., 16 Feb 2026) extends the framework from terms to equations. A constrained existential equation has the form

$\bar{\exists}$0

where $\bar{\exists}$1 entails existence of witnesses for $\bar{\exists}$2 satisfying $\bar{\exists}$3. Extra variables introduced by rule application are existentially quantified in the resulting equation, and the RI procedure extends Simplification, Expansion, and Deletion accordingly. The soundness theorem states that if the RI procedure starts from $\bar{\exists}$4 and derives $\bar{\exists}$5 over a terminating LCTRS, then every constrained existential equation in $\bar{\exists}$6 is an inductive theorem. This places existentially constrained terms inside a larger proof-theoretic system in which existential witnesses are not merely semantic parameters of rewriting but first-class components of inductive reasoning.

4. Categorical logic and existential completion

In categorical logic, the relevant object is not a term paired with a constraint formula but a doctrine in which existential quantification becomes available along morphisms. "The existential completion" (Trotta, 2021) starts with a primary doctrine $\bar{\exists}$7 on a category $\bar{\exists}$8 with finite products and defines an existential doctrine by requiring that reindexing along each projection $\bar{\exists}$9 has a left adjoint $w \in L_I(E)$00 satisfying Beck–Chevalley and Frobenius reciprocity: $w \in L_I(E)$01 In an elementary existential doctrine, one further obtains left adjoints to arbitrary reindexings,

$w \in L_I(E)$02

with adjunction law

$w \in L_I(E)$03

The existential completion $w \in L_I(E)$04 freely adds such $w \in L_I(E)$05-operators. For each object $w \in L_I(E)$06, the fiber $w \in L_I(E)$07 consists of pairs $w \in L_I(E)$08 ordered by existence of a mediating map $w \in L_I(E)$09 with $w \in L_I(E)$10 and $w \in L_I(E)$11. Reindexing is by pullback, while existential pushforward along $w \in L_I(E)$12 is composition: $w \in L_I(E)$13 Terms, understood as morphisms $w \in L_I(E)$14, thereby become “existentially constrained” because predicates on $w \in L_I(E)$15 are pushed to $w \in L_I(E)$16 by $w \in L_I(E)$17 and are required to interact correctly with substitution and meets.

The construction has a universal property. Writing $w \in L_I(E)$18 for existential completion and $w \in L_I(E)$19 for forgetful functor, the paper proves $w \in L_I(E)$20, identifies the induced 2-monad $w \in L_I(E)$21, proves that $w \in L_I(E)$22 is lax-idempotent, and shows

$w \in L_I(E)$23

If $w \in L_I(E)$24 is elementary, then $w \in L_I(E)$25 is again elementary. The paper also extends exact completion by first existentially completing an elementary doctrine and then applying exact completion, yielding $w \in L_I(E)$26.

In this setting, existentially constrained terms are best understood as terms $w \in L_I(E)$27 equipped with existential pushforwards $w \in L_I(E)$28 that encode “there exists a witness along $w \in L_I(E)$29.” The notion is therefore structural and fibrational rather than syntactic. It relocates existential constraint from formulas about terms to doctrine-level adjunctions governing how predicates move along terms.

5. Type-theoretic and programming-language formulations

Several programming-language formalisms use existential constraints to regulate hidden witnesses, type instantiation, or choice arguments. In "A Lazy Language Needs a Lazy Type System: Introducing Polymorphic Contexts" (Swierstra et al., 2016), the new quantifier $w \in L_I(E)$30 supports a reversal of instantiation. A function may compute a type as part of its result, and the caller may pass part of that existential result back as an argument to the same call in a lazy setting. The key rules are the $w \in L_I(E)$31-introduction and elimination rules

$w \in L_I(E)$32

This makes terms existentially constrained by a returned type witness. The paper uses this mechanism for circular programs such as idTree and for an implementation of the strict-state thread monad $w \in L_I(E)$33 in which a returned existential type specializes a polymorphic function.

"Coming to Terms with Your Choices: An Existential Take on Dependent Types" (Schmid et al., 2020) develops a dependently typed calculus with singleton types, subtyping, and a non-deterministic choice operator choose[B]. Soundness is obtained by lowering precise singleton types to types existentially quantified over Trail arguments representing choices. The paper introduces type normalization, Trail-based existential quantification, and an untangling function $w \in L_I(E)$34 that replaces Trail-dependent occurrences by ordinary existential types. This makes existentially constrained terms the type-theoretic image of non-deterministic term-level choices.

"Higher-Order Constrained Horn Clauses and Refinement Types" (Burn et al., 2017) treats existential constraints both at base type and at higher order. Goal formulas admit $w \in L_I(E)$35, and the extension with type-guarded existentials

$w \in L_I(E)$36

uses refinement types directly as guards. The monotone semantics admits a canonical model via the least fixed point of a monotone logic program operator, and the paper shows that type-guarded existentials can be eliminated by replacing the witness with the largest admissible element $w \in L_I(E)$37. This gives a precise notion of existentially constrained higher-order terms whose witnesses are not arbitrary elements of a sort but elements admitted by a refinement type.

"Reflections on existential types" (Sterling, 2022) reconstructs existential types from a reflective subuniverse and dependent sums: $w \in L_I(E)$38 Introduction is by $w \in L_I(E)$39, elimination is by scoped unpacking, and the hidden witness cannot escape. The same construction gives a semantic account of first-class modules, where reflective packages of second-class modules behave as existentially constrained terms whose clients may use only the abstract interface.

Taken together, these systems show that existentially constrained terms in type theory are terms whose typing or elimination rules are parameterized by hidden but semantically indispensable witnesses. What differs is whether the witness is a type, a choice argument, a higher-order relation, or a module representation.

6. Proof theory, automata, support exactness, and recurring limits

In proof theory, the phrase appears in a syntactic form. "Provably Total Functions of Arithmetic with Basic Terms" (Makarov, 2012) constrains eigenterms in universal elimination and existential introduction to the grammar

$w \in L_I(E)$40

A total function is “provable with basic terms” when its totality can be derived under this restriction, and the paper proves that these are exactly the provably recursive functions of $w \in L_I(E)$41. Here existentially constrained terms are witness terms in the quantifier rules: existence must be justified by basic constructor-built witnesses rather than arbitrary function terms.

In automata-theoretic rewriting, "On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms" (Nishida et al., 2013) defines the ground instances of a constrained term $w \in L_I(E)$42 as

$w \in L_I(E)$43

The existential content is explicit: ground instances are collected by existential quantification over substitutions satisfying the constraint. The paper constructs deterministic, complete, and constraint-complete constrained tree automata recognizing these sets, and reduces reduction-completeness and sufficient completeness questions to intersection-emptiness problems for such automata.

In syntax with exact supports, "Everybody's Got To Be Somewhere" (McBride, 2018) gives a co-de-Bruijn representation in which a term at ambient scope $w \in L_I(E)$44 is packaged as a thing-with-thinning $w \in L_I(E)$45, carrying an exact support $w \in L_I(E)$46 and an order-preserving inclusion $w \in L_I(E)$47. The construction enforces that every variable in $w \in L_I(E)$48 occurs somewhere in the subterm and every variable in $w \in L_I(E)$49 is absent. Existential content is carried by the support package itself: there exists an exact support and thinning witnessing where the term actually depends on the ambient context.

Several formulations also isolate sharp technical limits. In constrained expressions, fixed interpretations may make satisfiability and membership undecidable, while the unfixed-interpretation case remains decidable and unary alphabets are identified as a complication for normalization (Champarnaud et al., 2014). In LCTRSs, extending partial constrained rewriting and its commutation properties beyond left-linear, left-value-free rules remains open (Aoto et al., 29 Jan 2026). For constrained tree automata, intersection emptiness is undecidable in general, so practical procedures rely on sufficient criteria such as absence of final states in product automata (Nishida et al., 2013). These limits are not accidental; they indicate that existential control increases expressive power precisely because witnesses are not predetermined.

Across these formalisms, existentially constrained terms are therefore not a single formal object but a recurring method for encoding dependence on witnesses while keeping that dependence disciplined. Sometimes the witness is a realization, sometimes a substitution, sometimes a morphism image, sometimes a hidden type, and sometimes an exact support. What remains constant is the role of existential quantification as the mechanism by which terms acquire expressive power beyond purely structural matching.