Results 41 to 50 of about 14,639 (283)
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kennaway, J.R. +3 more
openaire +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
Hereditary Substitution for the λΔ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics.
Harley Eades, Aaron Stump
doaj +1 more source
The permutative lambda calculus
, 2012 We introduce the permutative lambda-calculus, an extension of lambda-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier's sigma-equivalence and Moggi's assoc-equivalence. We prove confluence modulo the equations and preservation of beta-strong normalisation (
Accattoli, Beniamino, Kesner, Delia
openaire +3 more sources
Minimal lambda-theories by ultraproducts [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating all the ...
Antonio Bucciarelli +2 more
doaj +1 more source
, 2009 The lambda calculus, developed in the 1930’s by Church and Curry, is a formalism for expressing higher-order functions. In a nutshell, a higher-order function is a function that inputs or outputs a “black box”, which is itself a (possibly higher-order) function. Higher-order functions are a computationally powerful tool. Indeed, the pure untyped lambda
Peter Selinger, Benoît Valiron
openaire +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus [PDF]
Logical Methods in Computer Science, 2018 Since it was realized that the Curry-Howard isomorphism can be extended to the case of classical logic as well, several calculi have appeared as candidates for the encodings of proofs in classical logic.
Péter Battyányi, Karim Nour
doaj +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +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