Titlebook: Automata, Languages and Programming; 16th International C Giorgio Ausiello,Mariangiola Dezani-Ciancaglini,Si Conference proceedings 1989 Sp

Ensign

書目名稱Automata, Languages and Programming影響因子(影響力)




書目名稱Automata, Languages and Programming影響因子(影響力)學科排名




書目名稱Automata, Languages and Programming網(wǎng)絡公開度




書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名




書目名稱Automata, Languages and Programming被引頻次




書目名稱Automata, Languages and Programming被引頻次學科排名




書目名稱Automata, Languages and Programming年度引用




書目名稱Automata, Languages and Programming年度引用學科排名




書目名稱Automata, Languages and Programming讀者反饋




書目名稱Automata, Languages and Programming讀者反饋學科排名

brassy

尾巴

antedate

Time lower bounds for CREW-PRAM computation of monotone functions,.), where . is the size of the largest prime implicant. It is also shown that the bound is existentially tight by constructing a family of monotone functions that can be computed in .=.(log .+(log .)/.), even by an EREW-PRAM. The same results hold if . is replaced by ., the size of the largest prime

RLS898

Subduing self-application, the following shape: . Two methods are described to derive the combinator representing f by means of a generalized morphism, avoiding the use of fixed point combinators and preserving strong normalizability, i.e. the same feature warranted by most type disciplines..Can a given combinator s represen

最后一個

柱廊

Polymorphic rewriting conserves algebraic strong normalization and confluence,dding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants..We show that if a many-sorted algebraic rewrite system . is strongly normalizing (terminating, noetherian), then . + β + η + type-β + type-η rewriting of mixed terms is also strongly normalizi

刺耳

Hypopnea

About primitive recursive algorithms,uages [3,11]. One approach relies on representation theorems [3,8,10], which show that a large class of general recursive functions can be encoded in a language where general recursion is replaced by primitive recursion with functions, functionals,… as parameters [13]..These results are however pure

特別容易碎