نتایج جستجو برای: lambda
تعداد نتایج: 25867 فیلتر نتایج به سال:
The cis-acting gene regulating specifically the inducibility of lambda 1-bearing B cells has been mapped within 2.9 cM of the structural gene. If the lambda 1lo-phenotype is due to the gly leads to val interchange in C lambda 1, then an argument can be made that (a) the lambda 1lo-phenotype is due to inefficient induction of lambda 1lo-bearing B cells and (b) B cell triggering is dependent upon...
SYSTEM of genetic transduction has been discovered in the sexually fertile A K-12 strain of Escherichia coli. This transduction is mediated by lambda, a temperate phage for which K-12 is normally lysogenic. The distinctive features of the lambda-K-12 system include the following: (1) The transductions are limited to a cluster of genes for galactose fermentation. The GaZ loci are closely linked ...
In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, whic...
dimethoate (organophosphate insecticide) and lambda-cyhalothrin (synthetic pyrithroid) aretwo frequently used pesticides due to their high effectiveness and rapid breakdown into environmentally safeproducts. the aim of this present study was to assess and compare the acute toxicity of dimethoate(rogor30%ec) and lambda-cyhalothrin (5%ec) on labeo rohita (hamilton). acute toxicity bioassay wascar...
The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLLS provides parallelism constraints to talk about the tree structure of lambda terms, and lambda binding constraints to specify variable binding. Parallelism constraints alone have the same expressiveness as context unification. In this paper, we show that lambda binding constraints can also be ex...
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Church–Rosser properties and functional computation model in symbolic and algebraic computation with induction. The algorithm which improved for Lambda-Beta Boolean reduction is simulated by the efficient logical programmin...
This paper introduces TILC: the interactive lambda-calculus tracer. TILC aims to be a friendly user graphical application that helps teaching/studying the main basic concepts of pure untyped lambda-calculus. This is achieved by allowing users to graphically interact with a sort of parse-tree of the lambda-terms and automatically reproducing these interactions in the lambda-term. This graphical ...
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
The genetic organization of the kappa and lambda light chain loci permits multiple, successive rearrangement attempts at each allele. Multiple rearrangements allow autoreactive B cells to escape clonal deletion by editing their surface receptors. Editing may also facilitate efficient B cell production by salvaging cells with nonproductive light chain (L chain) rearrangements. To study receptor ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید