Higher-Order Beta Matching with Solutions in Long Beta-Eta Normal Form

Higher-order matching is a special case of unification of simply-typed lambda-terms: in a matching equation, one of the two sides contains no unification variables. Loader has recently shown that higher-order matching up to beta equivalence is undecidable, but decidability of higher-order matching up to beta-eta equivalence is a long-standing open problem. We show that higher-order matching up to beta-eta equivalence is decidable if and only if a restricted form of higher-order matching up to beta equivalence is decidable: the restriction is that solutions must be in long beta-eta normal form

Nominal Unification of Higher Order Expressions with Recursive Let

A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine the complexity of corresponding unification problems.Comment: Pre-proceedings paper presented at the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, Scotland UK, 6-8 September 2016 (arXiv:1608.02534

Combining second order matching and first order E-matching

We propose an algorithm for combining second order matching and first order matching in an algebraic first order theory E. This algorithm has the flavor of the higher order E-unification algorithmof Nipkow and Qian, but relies on the classical second order matching algorithm of Huet and Lang instead of higher order unification. Since matching is simpler than unification, we are able to prove the termination of our algorithm when the algebraic theory E respects some conditions. We show that it is possible to preserve the termination when we relax some of these conditions by adapting the previous algorithm. It allows us to use AC1, ACI and ACI1 for example. These algebraic theories are the more useful for our purpose (recognizing logical or functional schemata). We have implemented our algorithm for the AC and AC1 theories and we show examples of possible applications

Specifying Theorem Provers in a Higher-Order Logic Programming Language

Since logic programming systems directly implement search and unification and since these operations are essential for the implementation of most theorem provers, logic programming languages should make ideal implementation languages for theorem provers. We shall argue that this is indeed the case if the logic programming language is extended in several ways. We present an extended logic programming language where first-order terms are replaced with simply-typed λ-terms, higher-order unification replaces firstorder unification, and implication and universal quantification are allowed in queries and the bodies of clauses. This language naturally specifies inference rules for various proof systems. The primitive search operations required to search for proofs generally have very simple implementations using the logical connectives of this extended logic programming language. Higher-order unification, which provides sophisticated pattern matching on formulas and proofs, can be used to determine when and at what instance an inference rule can be employed in the search for a proof. Tactics and tacticals, which provide a framework for high-level control over search, can also be directly implemented in this extended language. The theorem provers presented in this paper have been implemented in the higher-order logic programming language λProlog

Two-loop matching coefficients for the strong coupling in the MSSM

When relating the strong coupling $\alpha_s$, measured at the scale of the $Z$ boson mass, to its numerical value at some higher energy, for example the scale of Grand Unification, it is important to include higher order corrections both in the running of $\alpha_s$ and the decoupling of the heavy particles. We compute the two-loop matching coefficients for $\alpha_s$ within the Minimal Supersymmetric Standard Model (MSSM) which are necessary for a consistent three-loop evolution of the strong coupling constant. Different scenarios for the hierarchy of the supersymmetric scales are considered and the numerical effects are discussed. We find that the three-loop effects can be as large as and sometimes even larger than the uncertainty induced by the current experimental accuracy of $\alpha_s(M_Z)$.Comment: 22 pages, 8 figures (13 ps/eps-files

Consistency and Completeness of Rewriting in the Calculus of Constructions

Adding rewriting to a proof assistant based on the Curry-Howard isomorphism, such as Coq, may greatly improve usability of the tool. Unfortunately adding an arbitrary set of rewrite rules may render the underlying formal system undecidable and inconsistent. While ways to ensure termination and confluence, and hence decidability of type-checking, have already been studied to some extent, logical consistency has got little attention so far. In this paper we show that consistency is a consequence of canonicity, which in turn follows from the assumption that all functions defined by rewrite rules are complete. We provide a sound and terminating, but necessarily incomplete algorithm to verify this property. The algorithm accepts all definitions that follow dependent pattern matching schemes presented by Coquand and studied by McBride in his PhD thesis. It also accepts many definitions by rewriting, containing rules which depart from standard pattern matching.Comment: 20 page

Effective field theory approach to trans-TeV supersymmetry: covariant matching, Yukawa unification and Higgs couplings

Dismissing traditional naturalness concerns while embracing the Higgs boson mass measurement and unification motivates careful analysis of trans-TeV supersymmetric theories. We take an effective field theory (EFT) approach, matching the Minimal Supersymmetric Standard Model (MSSM) onto the Standard Model (SM) EFT by integrating out heavy superpartners, and evolving MSSM and SMEFT parameters according to renormalization group equations in each regime. Our matching calculation is facilitated by the recent covariant diagrams formulation of functional matching techniques, with the full one-loop SUSY threshold corrections encoded in just 30 diagrams. Requiring consistent matching onto the SMEFT with its parameters (those in the Higgs potential in particular) measured at low energies, and in addition requiring unification of bottom and tau Yukawa couplings at the scale of gauge coupling unification, we detail the solution space of superpartner masses from the TeV scale to well above. We also provide detailed views of parameter space where Higgs coupling measurements have probing capability at future colliders beyond the reach of direct superpartner searches at the LHC.Comment: 59 pages, 8 figures; v2: references and minor clarifications adde