Results 31 to 40 of about 230,472 (297)
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
Reduction in a linear lambda-calculus with applications to operational semantics [PDF]
, 2005 We study beta-reduction in a linear lambda-calculus derived from Abramsky's linear combinatory algebras. Reductions are classified depending on whether the redex is in the computationally active part of a term ("surface" reductions) or whether it is ...
Simpson, Alexander, Alex Simpson
core +1 more source
Thunks and the lambda-Calculus
BRICS Report Series, 1996 <p>Thirty-five years ago, thunks were used to simulate call-by-name<br />under call-by-value in Algol 60. Twenty years ago, Plotkin presented continuation-based simulations of call-by-name under call-by-value and vice versa in the lambda-calculus. We connect all three of these classical simulations by factorizing the continuation-based call-
John Hatcliff, Olivier Danvy
openaire +2 more sources
A Strong Bisimulation for a Classical Term Calculus [PDF]
Logical Methods in Computer ScienceWhen 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 +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
Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors [PDF]
Logical Methods in Computer Science, 2019 It has been known since Ehrhard and Regnier's seminal work on the Taylor expansion of $\lambda$-terms that this operation commutes with normalization: the expansion of a $\lambda$-term is always normalizable and its normal form is the expansion of the B\"
Lionel Vaux
doaj +1 more source
A Braided Lambda Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2021 We present an untyped linear lambda calculus with braids, the corresponding combinatory logic, and the semantic models given by crossed G-sets.
openaire +2 more sources
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications [PDF]
Logical Methods in Computer ScienceWe 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 +2 more
doaj +1 more source
Characterisation of Strongly Normalising lambda-mu-Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types.
Steffen van Bakel +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