Results 21 to 30 of about 13,265 (227)
Supervised data extraction from transformer representation of Lambda-terms
The object of this research is the process of compiler optimization, as it is essential in modern software development, particularly in functional programming languages like Lambda Calculus.
Oleksandr Deineha
doaj +1 more source
Counting and Generating Terms in the Binary Lambda Calculus (Extended version) [PDF]
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
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed [PDF]
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine?
Accattoli, Beniamino, Lago, Ugo Dal
core +5 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
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
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
Towards sharing in lazy computation systems [PDF]
Work on proving congruence of bisimulation in functional programming languages often refers to [How89,How96], where Howe gave a highly general account on this topic in terms of so-called lazy computation systems .
Mann, Matthias
core
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Stoevring, Kristian
core +7 more sources
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
Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq [PDF]
This paper shows equivalence of several versions of applicative similarity and contextual approximation, and hence also of applicative bisimilarity and contextual equivalence, in LR, the deterministic call-by-need lambda calculus with letrec extended by ...
Machkasova, Elena +2 more
core +1 more source
Development of human monoclonal antibodies against TARM1 by yeast display
Human monoclonal antibodies against TARM1 are generated by yeast display‐guided selection. These antibodies bind to soluble and cell‐surface forms of TARM1. Also, these antibodies exhibit agonistic activity in the NFAT‐GFP reporter assay, indicating that TARM1 signaling can be functionally modulated by antibodies and suggesting TARM1 as a potential ...
Rikio Yabe +5 more
wiley +1 more source

