Results 61 to 70 of about 230,472 (297)
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
Java & Lambda: a Featherweight Story [PDF]
We present FJ&$\lambda$, a new core calculus that extends Featherweight Java (FJ) with interfaces, supporting multiple inheritance in a restricted form, $\lambda$-expressions, and intersection types.
Lorenzo Bettini +4 more
doaj +1 more source
On correctness of buffer implementations in a concurrent lambda calculus with futures [PDF]
Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other.
Sabel, David +3 more
core
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
Evaluating functions as processes [PDF]
A famous result by Milner is that the lambda-calculus can be simulated inside the pi-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between beta-reduction and how it is simulated in
Beniamino Accattoli
doaj +1 more source
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec [PDF]
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence the call-by-name and the call-by-need evaluation are equivalent, and also that the unrestricted copy-operation is correct ...
Schmidt-Schauß, Manfred +1 more
core
Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments
Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley +1 more source
Gödelisation in the lambda-Calculus
Gödelisation is a meta-linguistic encoding of terms in a language. While it is impossible to define an operator in the lambda-calculus which encodes all closed lambda-expressions, it is possible to construct restricted versions of such an encoding operator.
openaire +2 more sources
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
Semantics of Higher-Order Recursion Schemes [PDF]
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in which the ...
Jiri Adamek, Stefan Milius, Jiri Velebil
doaj +1 more source

