Results 31 to 40 of about 11,463 (263)
Local Termination: theory and practice [PDF]
Logical Methods in Computer Science, 2010 The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years.
Joerg Endrullis +2 more
doaj +1 more source
Counting and Generating Terms in the Binary Lambda Calculus (Extended version) [PDF]
, 2014 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
COMBINATORY LOGIC AND $ lambda $-CALCULUS FOR CLASSICAL LOGIC [PDF]
Bulletin of informatics and cybernetics, 2000 Summary: Since Griffin's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Griffin's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with
Baba, Kensuke +2 more
openaire +2 more sources
Advances in Electrical and Electronic Engineering, 2011 The Reactive power flow’s is one of the most electrical distribution systems problem wich have great of interset of the electrical network researchers, it’s cause’s active power transmission reduction, power losses decreasing, and the drop voltage’s ...
Nasri Abdelfatah, Gasbaoui Brahim
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
LangPro: Natural Language Theorem Prover [PDF]
, 2017 LangPro is an automated theorem prover for natural language (https://github.com/kovvalsky/LangPro). Given a set of premises and a hypothesis, it is able to prove semantic relations between them. The prover is based on a version of analytic tableau method
Abzianidze, Lasha
core +2 more sources
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Normal-order reduction grammars
, 2016 We present an algorithm which, for given $n$, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set $\{S,K\}$ of primitive combinators, requiring exactly $n$ normal-order reduction steps to normalize.
Bendkowski, Maciej
core +1 more source
Constructive set theory and Brouwerian principles [PDF]
, 2005 The paper furnishes realizability models of constructive Zermelo-Fraenkel set theory, CZF, which also validate Brouwerian principles such as the axiom of continuous choice (CC), the fan theorem (FT), and monotone bar induction (BIM), and thereby ...
Rathjen, M
core +2 more sources
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
Molecular Oncology, EarlyView.IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source