English
Related papers

Related papers: Level-Confluence of 3-CTRSs in Isabelle/HOL

200 papers

Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the…

Logic in Computer Science · Computer Science 2007-05-23 Frederic Blanqui

We present some new results on the cohomology of a large scope of SL\_2-groups in degrees above the virtual cohomological dimension; yielding some partial positive results for the Quillen conjecture in rank one. We combine these results…

K-Theory and Homology · Mathematics 2019-05-01 Alexander Rahm , Matthias Wendt

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…

Logic in Computer Science · Computer Science 2015-07-01 Daria Walukiewicz-Chrzaszcz , Jacek Chrzaszcz

In-context learning (ICL) refers to the ability of a model to learn new tasks from examples in its input without any parameter updates. In contrast to previous theories of ICL relying on toy models and data settings, recently it has been…

Machine Learning · Computer Science 2025-12-15 Francesco Innocenti , El Mehdi Achour

The construction of the fusion ring of a quasi-rational CFT based on $\hat{sl}(3)_k$ at generic level $k\not \in {\Bbb Q}$ is reviewed. It is a commutative ring generated by formal characters, elements in the group ring ${\Bbb…

High Energy Physics - Theory · Physics 2007-05-23 P. Furlan , V. B. Petkova

In a recent paper, the second author and Joana Cirici proved a theorem that says that given appropriate hypotheses, $n$-formality of a differential graded algebraic structure is equivalent to the existence of a chain-level lift of a…

Algebraic Topology · Mathematics 2022-09-23 Gabriel C. Drummond-Cole , Geoffroy Horel

Using Isabelle/HOL, we verify the state-of-the-art decision procedure for multi-level syllogistic with singleton (MLSS for short), which is a quantifier-free fragment of set theory. We formalise its syntax and semantics as well as a sound…

Logic in Computer Science · Computer Science 2023-07-04 Lukas Stevens

Implicit in-context learning (ICL) has newly emerged as a promising paradigm that simulates ICL behaviors in the representation space of Large Language Models (LLMs), aiming to attain few-shot performance at zero-shot cost. However,…

Computation and Language · Computer Science 2025-09-30 Jiaqian Li , Yanshu Li , Ligong Han , Ruixiang Tang , Wenya Wang

In-context learning (ICL) enables large language models to adapt to new tasks from demonstrations without parameter updates. Despite extensive empirical studies, a principled understanding of ICL emergence at scale remains more elusive. We…

Machine Learning · Computer Science 2025-11-11 Sushant Mehta , Ishan Gupta

We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type…

Logic in Computer Science · Computer Science 2021-12-14 Deivid Vale , Niels van der Weide

This note is a sequel to our earlier paper of the same title [dg-ga/9710001] and describes invariants of rational homology 3-spheres associated to acyclic orthogonal local systems. Our work is in the spirit of the Axelrod-Singer papers,…

Geometric Topology · Mathematics 2020-05-29 Raoul Bott , Alberto S. Cattaneo

Modification of the renormalization-group approach, invoking Stratonovich transformation at each step, is proposed to describe phase transitions in 3D Ising-class systems. The proposed method is closely related to the mean-field…

Statistical Mechanics · Physics 2009-11-07 A. N. Rubtsov

We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof goal and its background context, PGT attempts to generate conjectures from the original goal by transforming the original proof goal. These conjectures should be weak…

Logic in Computer Science · Computer Science 2018-07-26 Yutaka Nagashima , Julian Parsert

The Isabelle/HOL proof assistant has a powerful library for continuous analysis, which provides the foundation for verification of hybrid systems. However, Isabelle lacks automated proof support for continuous artifacts, which means that…

Logic in Computer Science · Computer Science 2021-02-05 Thomas Hickman , Christian Pardillo Laursen , Simon Foster

The need for formal definition of the very basis of mathematics arose in the last century. The scale and complexity of mathematics, along with discovered paradoxes, revealed the danger of accumulating errors across theories. Although,…

Logic in Computer Science · Computer Science 2018-09-10 Artem Yushkovskiy

In this article we give an explicit construction of the moduli space of trigonal superelliptic curves with level 3 structure. The construction is given in terms of point sets on the projective line and leads to a closed formula for the…

Algebraic Geometry · Mathematics 2021-07-05 Olof Bergvall , Oliver Leigh

We have formalised Szemer\'edi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions, two major results in extremal graph theory and additive combinatorics, using the proof assistant Isabelle/HOL. For the latter formalisation, we…

Logic in Computer Science · Computer Science 2022-10-14 Chelsea Edmonds , Angeliki Koutsoukou-Argyraki , Lawrence C. Paulson

Equivalence classes of gapped Hamiltonians compatible with given symmetry constraints, such as those underlying topological insulators, can be defined in many ways. For the non-chiral classes modelled by vector bundles over Brillouin tori,…

Mathematical Physics · Physics 2015-10-13 Guo Chuan Thiang

We consider the Krall-Sheffer class of admissible, partial differential operators in the plane. We concentrate on algebraic structures, such as the role of commuting operators and symmetries. For the polynomial eigenfunctions, we give…

Mathematical Physics · Physics 2013-07-02 Allan P. Fordy , Michael J. Scott

In-context learning (ICL) refers to the ability of a model to condition on a few in-context demonstrations (input-output examples of the underlying task) to generate the answer for a new query input, without updating parameters. Despite the…

Machine Learning · Computer Science 2023-12-01 Yongqiang Chen , Binghui Xie , Kaiwen Zhou , Bo Han , Yatao Bian , James Cheng