Related papers: Y is a least fixed point combinator

Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…

In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…

We state a Yoneda-type lemma which leads to various functor categories being compact closed.

In this paper we consider the long-term behavior of points in ${\mathbb R}$ under iterations of continuous functions. We show that, given any Cantor set $\Lambda^*$ embedded in ${\mathbb R}$, there exists a continuous function $F^*:{\mathbb…

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…

We consider unitary Virasoro minimal models on the disk with Cardy boundary conditions and discuss deformations by certain relevant boundary operators, analogous to tachyon condensation in string theory. Concentrating on the least relevant…

In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of…

Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's…

In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…

This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…

We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we…

Representation theorems are established for fixed points of adjoint functors between categories enriched in a small quantaloid. In a very general setting these results set up a common framework for representation theorems of concept…

Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…

It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the alge- braic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…

We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…

In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…

In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak…

The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…