Titlebook: Automata, Languages and Programming; 17th International C Michael S. Paterson Conference proceedings 1990 Springer-Verlag Berlin Heidelberg

Traction

書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)




書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次




書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages and Programming年度引用




書(shū)目名稱(chēng)Automata, Languages and Programming年度引用學(xué)科排名




書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋




書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋學(xué)科排名

Feigned

悲觀(guān)

A complete and decidable proof system for call-by-value equalities,in a standard call-by-value model, settling an open question of [10]. By the full abstraction theorem of [20, 22], the logic proves all call-by-value observational congruences between pure terms. Finally, we show that the equations true in the standard model are decidable.

火花

寬大

Two-way automata with multiplicity,m to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using spec

Defiance

射手座

BADGE

Functions as processes,s a recent step [15] towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked by a short sequence of reductions in π-calculus. Abramsky‘s precongruence of . [1] over λ-

新手

A domain-theoretic model for a higher-order process calculus,odel is constructed domain-theoretically and reflects a certain conceptual view-point about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one

parallelism