Related papers: Full normalization for transfinite stacks
We extend the normalization results of the author's paper "Full normalization for transfinite stacks" [5] to mice at the level of $\kappa^+$-supercompactness: given a normal iteration strategy $\Sigma$ for such a mouse $M$, with both $M$…
We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…
We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…
We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…
The aim of this work is to characterize three fundamental normalization proprieties in lambda-calculus trough the Taylor expansion of $ \lambda$-terms. The general proof strategy consists in stating the dependence of ordinary reduction…
The prevailing mindset is that a single decision tree underperforms classic random forests in testing accuracy, despite its advantages in interpretability and lightweight structure. This study challenges such a mindset by significantly…
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it…
The exploration of solid-solid phase transition suffers from the uncertainty of how atoms in two crystal structures match. We devised a theoretical framework to describe and classify crystal-structure matches (CSM). Such description fully…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly…
We develop a general theory of strategic mice, prove their condensation properties, and analyze the scales pattern in the stack of $\Theta$-g-organized $\mathcal{F}$-mice over $\mathbb{R}$, Lp$^{G\mathcal{F}}(\mathbb{R})$, for a class of…
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games in Cantor or Baire space, and the existence of functions generalized-recursive in a higher type-2 functional.…
In this work we study randomised reduction strategies,a notion already known in the context of abstract reduction systems, for the $\lambda$-calculus. We develop a simple framework that allows us to prove a randomised strategy to be…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…
The purpose of this paper is to build an algebraic framework suited to regularise branched structures emanating from rooted forests and which encodes the locality principle. This is achieved by means of the universal properties in the…
The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum has been shown experimentally to give asymptotically…
Generalized Ising models, also known as cluster expansions, are an important tool in many areas of condensed-matter physics and materials science, as they are often used in the study of lattice thermodynamics, solid-solid phase transitions,…