Results 41 to 50 of about 31,361 (278)
Complex Systems, 2013 We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally planar tangle diagrams.
openaire +2 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
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kennaway, J.R. +3 more
openaire +1 more source
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
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
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
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
No solvable lambda-value term left behind [PDF]
Logical Methods in Computer Science, 2016 In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form.
Á. García-Pérez, P. Nogueira
doaj +1 more source