Tootfinder

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
Opportunistically Parallel Lambda Calculus
https://

Term Assignment and Categorical Models for Intuitionistic Linear Logic with Subexponentials
Daniel Rogozin
https://arxiv.org/abs/2507.12360 https://…

Term Assignment and Categorical Models for Intuitionistic Linear Logic with Subexponentials
In this paper, we present a typed lambda calculus ${\bf SILL}(λ)_Σ$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections between them given by a subexponential signature. We also give proof normalisation rules and prove the strong normalisation and Church-Rosser properties for $β$-reduction by adapting the Tait-Girard method to subexponential modalities. Further, we analyse subexponential…

Encoding call-by-push-value in the pi-calculus
Benjamin Bennetzen, Nikolaj Rossander Kristensen, Peter Buus Steffensen
https://arxiv.org/abs/2506.10584 htt…

Encoding call-by-push-value in the pi-calculus
In this report we define an encoding of Levys call-by-push-value lambda-calculus (CBPV) in the pi-calculus, and prove that our encoding is both sound and complete. We present informal (by-hand) proofs of soundness, completeness, and all required lemmas. The encoding is specialized to the internal pi-calculus (pi-i-calculus) to circumvent certain challenges associated with using de Bruijn index in a formalization, and it also helps with bisimulation as early-, late- and open-bisimulation coincid…

from my link log —
Lambda calculus cooked N ways: Benchmarks for capture-avoiding substitution.
https://github.com/sweirich/lambda-n-ways
saved 2025-06-14

GitHub - sweirich/lambda-n-ways: Benchmarks for capture-avoiding substitution
Benchmarks for capture-avoiding substitution. Contribute to sweirich/lambda-n-ways development by creating an account on GitHub.

from my link log —
The Epic Verse calculus: a core calculus for functional logic programming.
https://simon.peytonjones.org/verse-calculus/
saved 2025-06-12

Homogeneous Linear Calculus of Order 1 and a $\lambda$-Taylor Formula
Ronald Orozco L\'opez
https://arxiv.org/abs/2506.22976 https://

Homogeneous Linear Calculus of Order 1 and a $λ$-Taylor Formula
In this paper, a new calculus on sequences is defined. Also, the $λ$-derivative and the $λ$-integration are investigated. The fundamental theorem of $λ$-calculus is included. A suitable function basis for the $λ$-derivative and the $λ$-integral is provided, and various properties of this basis are given. A $λ$-Taylor formula for functions is given.

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
Alejandro D\'iaz-Caro, Nicolas A. Monzon
https://arxiv.org/abs/2506.16244 https://

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
We introduce Lambda-SX, a typed quantum lambda-calculus that supports multiple measurement bases. By tracking duplicability relative to arbitrary bases within the type system, Lambda-SX enables more flexible control and compositional reasoning about measurements. We formalise its syntax, typing rules, subtyping, and operational semantics, and establish its key meta-theoretical properties. This proof-of-concept shows that support for multiple bases can be coherently integrated into the type disc…

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Ohana trees and Taylor expansion for the $\lambda$I-calculus. No variable gets left behind or for...
R\'emy Cerda, Giulio Manzonetto, Alexis Saurin

Scott's Representation Theorem and the Univalent Karoubi Envelope
Arnoud van der Leer, Kobe Wullaert, Benedikt Ahrens
https://arxiv.org/abs/2506.22196 …

Scott's Representation Theorem and the Univalent Karoubi Envelope
Lambek and Scott constructed a correspondence between simply-typed lambda calculi and Cartesian closed categories. Scott's Representation Theorem is a cousin to this result for untyped lambda calculi. It states that every untyped lambda calculus arises from a reflexive object in some category. We present a formalization of Scott's Representation Theorem in univalent foundations, in the (Rocq-)UniMath library. Specifically, we implement two proofs of that theorem, one by Scott and one by Hyland.…

Have Object-Oriented Languages Missed a Trick with Class Function and its Subclasses?
Lloyd Allison
https://arxiv.org/abs/2507.00488 https://

Have Object-Oriented Languages Missed a Trick with Class Function and its Subclasses?
Compared to functions in mathematics, functions in programming languages seem to be under classified. Functional programming languages based on the lambda calculus famously treat functions as first-class values. Object-oriented languages have adopted ``lambdas'', notably for call-back routines in event-based programming. Typically a programming language has functions, a function has a type, and some functions act on other functions and/or return functions but there is generally a lack of (i) ``…