Related papers: E-unification for Second-Order Abstract Syntax
Using Isabelle/HOL, we verify a union-find data structure with an explain operation due to Nieuwenhuis and Oliveras. We devise a simpler, more naive version of the explain operation whose soundness and completeness is easy to verify. Then,…
The method of sub-iteration, which was previously applied to the higher-order coupled cluster amplitude equations, is extended to the case of the coupled cluster $\Lambda$ equations. The sub-iteration procedure for the $\Lambda$ equations…
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…
In this work, we introduce a novel abstract framework for the stability and convergence analysis of fully coupled discretisations of the poroelasticity problem and apply it to the analysis of Hybrid High-Order (HHO) schemes. A relevant…
We propose a general framework to contract unitary dual of Lie groups via holomorphic quantization of their co-adjoint orbits. The sufficient condition for the contractability of a representation is expressed via cocycles on coadjoint…
Reachability analysis for hybrid systems is an active area of development and has resulted in many promising prototype tools. Most of these tools allow users to express hybrid system as automata with a set of ordinary differential equations…
We analyze Yukawa unification in the the context of $E_8\times E_8$ heterotic Calabi-Yau models which rely on breaking to a GUT theory via a non-flat gauge bundle and subsequent Wilson line breaking to the standard model. Our focus is on…
We introduce an extension of first-order logic that comes equipped with additional predicates for reasoning about an abstract state. Sequents in the logic comprise a main formula together with pre- and postconditions in the style of Hoare…
This paper presents a study of operational and type-theoretic properties of different resolution strategies in Horn clause logic. We distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by…
End-to-End Speech Translation often shows slower convergence and worse performance when target transcriptions exhibit high variance and semantic ambiguity. We propose Listen, Attend, Understand (LAU), a semantic regularization technique…
In this paper we consider an alternative approach to "un-reduction". This is the process where one associates to a Lagrangian system on a manifold a dynamical system on a principal bundle over that manifold, in such a way that solutions…
In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…
Recently, it has been shown how to perform the quantum hamiltonian reduction in the case of general $sl(2)$ embeddings into Lie (super)algebras, and in the case of general $osp(1|2)$ embeddings into Lie superalgebras. In another development…
The unified product was defined in \cite{am3} related to the restricted extending structure problem for Hopf algebras: a Hopf algebra $E$ factorizes through a Hopf subalgebra $A$ and a subcoalgebra $H$ such that $1\in H$ if and only if $E$…
This paper presents the design and analysis of a Hybrid High-Order (HHO) approximation for a distributed optimal control problem governed by the Poisson equation. We propose three distinct schemes to address unconstrained control problems…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term…
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which has…
Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification. While automata-based verification scales well when…
Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that…