English
Related papers

Related papers: Confluency property of the call-by-value $\lambda\…

200 papers

We prove a congruence criterion for the algebraic theory of power operations in Morava E-theory, analogous to Wilkerson's congruence criterion for torsion free lambda-rings. In addition, we provide a geometric description of this congruence…

Algebraic Topology · Mathematics 2009-12-07 Charles Rezk

The main theorem of this paper states that the c-convexity and the alternative c-convexity are equivalent if and only if the cost function c satisfies MTW condition. The alternative c-convex function is an analogy of the definition of the…

Optimization and Control · Mathematics 2025-10-08 Seonghyeon Jeong

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…

Logic in Computer Science · Computer Science 2021-02-01 Tatsuya Abe , Daisuke Kimura

First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching. Moreover, we study the weak variant…

Programming Languages · Computer Science 2015-07-01 Pietro Di Gianantonio , Furio Honsell , Marina Lenisa

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

Logic · Mathematics 2026-03-27 Yair Hayut , Alejandro Poveda

There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…

Artificial Intelligence · Computer Science 2013-01-14 Daniel Pless , George Luger

The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of…

Programming Languages · Computer Science 2012-09-27 Antoine Madet

This work gives some insights and results on standardisation for call-by-name pattern calculi. More precisely, we define standard reductions for a pattern calculus with constructor-based data terms and patterns. This notion is based on…

Logic in Computer Science · Computer Science 2011-02-21 Delia Kesner , Carlos Lombardi , Alejandro Ríos

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

We show that assuming lower bounds on the Ricci curvature and the injectivity radius the absolute value of certain characteristic numbers of a Riemannian manifold, including all Pontryagin and Chern numbers, is bounded proportionally to the…

Differential Geometry · Mathematics 2021-05-18 Daniel Luckhardt

Let $\FF$ be a finite field and $(Q,\bfd)$ an acyclic valued quiver with associated exchange matrix $\tilde{B}$. We follow Hubery's approach \cite{hub1} to prove our main conjecture of \cite{rupel}: the quantum cluster character gives a…

Quantum Algebra · Mathematics 2018-06-06 Dylan Rupel

We show that the natural "convolution" on the space of smooth, even, translation-invariant convex valuations on a euclidean space $V$, obtained by intertwining the product and the duality transform of S. Alesker, may be expressed in terms…

Differential Geometry · Mathematics 2008-03-27 Andreas Bernig , Joseph H. G. Fu

We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed lambda-mu-calculus. We also extend Mendler's result on…

Logic · Mathematics 2009-05-19 René David , Karim Nour

There is a natural descending filtration on the singular cohomology of a complex smooth projective variety called the coniveau filtration. The generalized Hodge conjecture would imply, rather trivially, that the coniveau filtration is…

Algebraic Geometry · Mathematics 2007-05-23 Donu Arapura , Su-Jeong Kang

A clover is a framed trivalent graph with some additional structure, embedded in a 3-manifold. We define surgery on clovers, generalizing surgery on Y-graphs used earlier by the second author to define a new theory of finite-type invariants…

Geometric Topology · Mathematics 2014-11-11 Stavros Garoufalidis , Mikhail Goussarov , Michael Polyak

This paper focuses on the class of routing games that have uncertain costs. Assuming that agents are risk-averse and select paths with minimum conditional value-at-risk (CVaR) associated to them, we define the notion of CVaR-based Wardrop…

Optimization and Control · Mathematics 2019-09-10 Ashish Cherukuri

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

Number Theory · Mathematics 2016-12-16 Rong Qiang Wei

In this paper, we investigate the converse of the Tan-Xu theorem, which states that the naturally reductive property of a Riemannian metric is inherited by a naturally reductive $(\alpha_1,\alpha_2)$-metric, and we show that, under certain…

General Mathematics · Mathematics 2026-02-18 Ali Hatami Shahi , Hamid Reza Salimi Moghaddam

Let $\mu$ and $\nu$ be two probability measures on $\R^d$, where $\mu(\d x)= \e^{-V(x)}\d x$ for some $V\in C^1(\R^d)$. Explicit sufficient conditions on $V$ and $\nu$ are presented such that $\mu*\nu$ satisfies the log-Sobolev, Poincar\'e…

Probability · Mathematics 2015-01-27 Feng-Yu Wang , Jian Wang

In Evan and Hendel's recent proof of an outstanding conjecture on the resistance distances of a family of linear 3-trees, a key technique in the proof was calculating the recursion satisfied by a family of determinants. The underlying…

Combinatorics · Mathematics 2026-01-09 Russell Jay Hendel