Results 211 to 220 of about 11,463 (263)
Benchmarking foundation cell models for post-perturbation RNA-seq prediction. [PDF]
BMC GenomicsCsendes G, Sanz G, Szalay KZ, Szalai B.
europepmc +1 more source
Unraveling the FGFR-RNA splicing axis: Mechanisms, oncogenic crosstalks and innovations for therapeutic purpose. [PDF]
Acta Pharm Sin BXian X +8 more
europepmc +1 more source
The Regulatory Logic of Planarian Stem Cell Differentiation
Pérez-Posada A +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Lecture Notes in Computer Science, 2014
We present Combinatory Logic Synthesizer CLS, a type-based tool to automatically compose larger systems from repositories of components. We overview its underlying theory, combinatory logic with intersection types, and exemplify its application to synthesis.
Jan Bessai +4 more
openaire +3 more sources
We present Combinatory Logic Synthesizer CLS, a type-based tool to automatically compose larger systems from repositories of components. We overview its underlying theory, combinatory logic with intersection types, and exemplify its application to synthesis.
Jan Bessai +4 more
openaire +3 more sources
Mathematical Structures in Computer Science, 2006
The $\lambda$-calculus is destructive: its main computational mechanism, beta reduction, destroys the redex, which makes replaying the computational steps impossible. Combinatory logic is a variant of the $\lambda$-calculus that maintains irreversibility.
DI PIERRO, ALESSANDRA +2 more
openaire +2 more sources
The $\lambda$-calculus is destructive: its main computational mechanism, beta reduction, destroys the redex, which makes replaying the computational steps impossible. Combinatory logic is a variant of the $\lambda$-calculus that maintains irreversibility.
DI PIERRO, ALESSANDRA +2 more
openaire +2 more sources
2011
Preface Elements of combinatory logic Objects, combinators and terms Various kinds of combinators Reductions and combinatory bases Main theorems Church-Rosser property Normal forms and consistency Fixed points Second fixed point theorem and undecidability Recursive functions and arithmetic Primitive and partial recursive functions First modeling of ...
openaire +1 more source
Preface Elements of combinatory logic Objects, combinators and terms Various kinds of combinators Reductions and combinatory bases Main theorems Church-Rosser property Normal forms and consistency Fixed points Second fixed point theorem and undecidability Recursive functions and arithmetic Primitive and partial recursive functions First modeling of ...
openaire +1 more source
1994
Abstract The λ.-calculus was invented in a historical period which was very active for Mathematical Logic. Inspired by Hilbert, many mathematicians were trying to capture the notion of effective calculability. Within the space of ten years the λ.-calculus, Recursive Function Theory and Turing Machines were all invented.
openaire +1 more source
Abstract The λ.-calculus was invented in a historical period which was very active for Mathematical Logic. Inspired by Hilbert, many mathematicians were trying to capture the notion of effective calculability. Within the space of ten years the λ.-calculus, Recursive Function Theory and Turing Machines were all invented.
openaire +1 more source
1978
The term “combinatorial logic network” describes an arrangement of digital circuits which contains no storage elements for the logic variables. The output variables y j are defined by the input variables x i alone, as illustrated by Fig. 9.1. In sequential logic circuits on the other hand, the output variables are also dependent on the state of the ...
Ulrich Tietze, Christoph Schenk
openaire +1 more source
The term “combinatorial logic network” describes an arrangement of digital circuits which contains no storage elements for the logic variables. The output variables y j are defined by the input variables x i alone, as illustrated by Fig. 9.1. In sequential logic circuits on the other hand, the output variables are also dependent on the state of the ...
Ulrich Tietze, Christoph Schenk
openaire +1 more source
2018
Combinatory logic comprises a battery of formalisms for expressing and studying properties of operations constitutive to contemporary logic and its applications. The sole syntactic category in combinatory logic is that of the applicative term. Closed terms are called ‘combinators’; there is no binding of variables.
openaire +1 more source
Combinatory logic comprises a battery of formalisms for expressing and studying properties of operations constitutive to contemporary logic and its applications. The sole syntactic category in combinatory logic is that of the applicative term. Closed terms are called ‘combinators’; there is no binding of variables.
openaire +1 more source
Asymptotic Properties of Combinatory Logic
2015We present a quantitative analysis of random combinatory logic terms. Our main goal is to investigate likelihood of semantic properties of random combinators. We show that asymptotically almost all weakly normalizing terms are not strongly normalizing.
Bendkowski, Maciej +2 more
openaire +2 more sources