Related papers: A Complete Finitary Refinement Type System for Sco…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
In sequential functional languages, sized types enable termination checking of programs with complex patterns of recursion in the presence of mixed inductive-coinductive types. In this paper, we adapt sized types and their metatheory to the…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by…
We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
In \cite{sp25}, continuous information frames were introduced that capture exactly all continuous domains. They are obtained from the information frames considered in \cite{sp21} by omitting the conservativity requirement. Information…
We consider the Zariski space of all places of an algebraic function field $F|K$ of arbitrary characteristic and investigate its structure by means of its patch topology. We show that certain sets of places with nice properties (e.g., prime…
We prove a characterization of F-rationality in terms of tight closure of products of parameter ideals. Our results are inspired by the theory of complete ideals for surfaces and, in particular, the fundamental results of Lipman-Teissier…
In this paper, we consider the systems with trajectories originating in the nonnegative orthant becoming nonnegative after some finite time transient. First we consider dynamical systems (i.e., fully observable systems with no inputs),…
This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…
We analyze a semi-implicit finite volume scheme for the Gray--Scott system, a model for pattern formation in chemical and biological media. We prove unconditional well-posedness of the fully discrete problem and establish qualitative…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
We consider a finite element discretization for the dual Rudin--Osher--Fatemi model using a Raviart--Thomas basis for $H_0 (\mathrm{div};\Omega)$. Since the proposed discretization has splitting property for the energy functional, which is…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
This report presents some fundamental mathematical results towards elucidating the information-geometric underpinnings of evolutionary modelling schemes for (quasi-)stationary discrete stochastic processes. The model class under…
In earlier work, the second author showed that a closed subset of a polynomial functor can always be defined by finitely many polynomial equations. In follow-up work on $\operatorname{GL}\nolimits_{\infty}$-varieties,…
For a family of domains in the Sierpinski gasket, we study harmonic functions of finite energy, characterizing them in terms of their boundary values, and study their normal derivatives on the boundary. We characterize those domains for…
Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they do not support function spaces, i.e. if X and Y are…