Results 31 to 40 of about 31,361 (278)

Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus [PDF]

Logical Methods in Computer Science, 2012
Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substitution ...
Beniamino Accattoli, Delia Kesner
doaj   +1 more source

Simulation in the call-by-need lambda-calculus with letrec [PDF]

, 2010
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec.
Machkasova, Elena, Sabel, David, Schmidt-Schauß, Manfred   +2 more
core   +1 more source

Krivine Machine and Taylor Expansion in a Non-uniform Setting [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
The Krivine machine is an abstract machine implementing the linear head reduction of lambda-calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a lambda-term accounting for the resources used by the linear head
Antoine Allioux
doaj   +1 more source

Infinitary $\lambda$-Calculi from a Linear Perspective (Long Version) [PDF]

, 2016
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained
Lago, Ugo Dal
core   +4 more sources

The dagger lambda calculus [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory.
Philip Atzemoglou
doaj   +1 more source

A Strong Bisimulation for a Classical Term Calculus [PDF]

Logical Methods in Computer Science
When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of $\lambda$-calculus translated to proof-nets, these inessential details are captured by a notion of equivalence on $\lambda$-terms ...
Eduardo Bonelli, Delia Kesner, Andrés Viso   +2 more
doaj   +1 more source

Ordered Models of the Lambda Calculus [PDF]

Logical Methods in Computer Science, 2013
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom ...
Antonino Salibra, Alberto Carraro
doaj   +1 more source

A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications [PDF]

Logical Methods in Computer Science
We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock $\beta$-redexes without resorting to the standard permutative conversions of generalized applications ...
José Espírito Santo, Delia Kesner, Loïc Peyrot   +2 more
doaj   +1 more source

Study of degenerate derangement polynomials by λ-umbral calculus

Demonstratio Mathematica, 2023
In the 1970s, Rota began to build completely rigid foundations for the theory of umbral calculus based on relatively modern ideas of linear functions and linear operators.
Yun Sang Jo, Park Jin-Woo
doaj   +1 more source

Counting and Generating Terms in the Binary Lambda Calculus (Extended version) [PDF]

, 2014
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences.
Grygiel, Katarzyna, Lescanne, Pierre
core   +7 more sources