English
Related papers

Related papers: A syntactical proof of the operational equivalence…

200 papers

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…

Logic in Computer Science · Computer Science 2019-03-21 Michele Basaldella

We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…

Logic in Computer Science · Computer Science 2021-05-18 Pedro Amorim , Dexter Kozen , Radu Mardare , Prakash Panangaden , Michael Roberts

We introduce a calculus of extensional resource terms. These are resource terms \`a la Ehrhard-Regnier, but in infinitely eta-long form. The calculus still retains a finite syntax and dynamics: in particular, we prove strong confluence and…

Logic in Computer Science · Computer Science 2026-04-22 Lison Blondeau-Patissier , Pierre Clairambault , Lionel Vaux Auclair

We present an operational semantics for the language MeTTa.

Logic in Computer Science · Computer Science 2023-05-30 Lucius Gregory Meredith , Ben Goertzel , Jonathan Warrell , Adam Vandervorst

We give an elementary symmetric function expansion for $M\Delta_{m_\gamma e_1}\Pi e_\lambda^{\ast}$ and $M\Delta_{m_\gamma e_1}\Pi s_\lambda^{\ast}$ when $t=1$ in terms of what we call $\gamma$-parking functions and lattice $\gamma$-parking…

Combinatorics · Mathematics 2023-03-10 Alessandro Iraci , Marino Romero

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

We prove an extensionality theorem for the "type-in-type" dependent type theory with Sigma-types. We suggest that the extensional equality type be identified with the logical equivalence relation on the free term model of type theory.

Logic in Computer Science · Computer Science 2014-01-07 Andrew Polonsky

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in $\lambda$-calculi by decomposing their normal forms into bisimilar subterms. Moreover, it typically allows for powerful up-to techniques, such as…

Logic in Computer Science · Computer Science 2023-06-22 Dariusz Biernacki , Serguei Lenglet , Piotr Polesiuk

Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…

Logic in Computer Science · Computer Science 2011-06-28 Ugo Dal Lago , Margherita Zorzi

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation…

Logic in Computer Science · Computer Science 2024-02-14 Rémy Cerda , Lionel Vaux Auclair

The algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…

Logic in Computer Science · Computer Science 2023-06-16 Axel Kerinec , Lionel Vaux Auclair

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

We will use a discrete analogue of the classical Laplace method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansion of the scaled $q$-exponential $(-q^{-nt+1/2}u;q)_{\infty}$ could be expressed…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ruiming Zhang

We prove the equivalence of the semantic version of Tarski's theorem on the undefinability of truth with a semantic version of the Diagonal Lemma, and also show the equivalence of syntactic Tarski's Undefinability Theorem with a weak…

Logic · Mathematics 2022-06-14 Saeed Salehi

In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…

Classical Analysis and ODEs · Mathematics 2016-10-26 Gergő Nemes , Adri B. Olde Daalhuis

We give closed-form expressions for the Dirichlet beta function at even positive integers and for the Dirichlet lambda function at odd positive integers, based on the function J(s) defined via convergent integral. We also show fundamental…

Number Theory · Mathematics 2014-05-13 JeonWon Kim

Let $j$ be an elementary embedding of $V_{\lambda}$ into $V_{\lambda}$ that is not the identity, and let $\kappa$ be the critical point of $j$. Let $\Cal A$ be the closure of $\{j\}$ under the operation $a (b)$ of application, and let…

Logic · Mathematics 2008-02-03 Thomas Jech

In this article, we obtain some results in the direction of ``infinite dimensional symplectic spectral theory". We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators.…

Spectral Theory · Mathematics 2024-07-02 Tiju Cherian John , V. B. Kiran Kumar , Anmary Tonny

We will use a discrete analogue of the classical Laplace method to show that the main term of the asymptotic expansions of certain entire functions, including Ramanujan's entire function $A_{q}(z)$, can be expressed in terms of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ruiming Zhang

The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…

General Mathematics · Mathematics 2016-05-25 Jeonwon Kim
‹ Prev 1 2 3 10 Next ›