Titlebook: Relational and Kleene-Algebraic Methods in Computer Science; 7th International Se Rudolf Berghammer,Bernhard M?ller,Georg Struth Conference

Ingrown-Toenail

書目名稱Relational and Kleene-Algebraic Methods in Computer Science影響因子(影響力)




書目名稱Relational and Kleene-Algebraic Methods in Computer Science影響因子(影響力)學(xué)科排名




書目名稱Relational and Kleene-Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度




書目名稱Relational and Kleene-Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Relational and Kleene-Algebraic Methods in Computer Science被引頻次




書目名稱Relational and Kleene-Algebraic Methods in Computer Science被引頻次學(xué)科排名




書目名稱Relational and Kleene-Algebraic Methods in Computer Science年度引用




書目名稱Relational and Kleene-Algebraic Methods in Computer Science年度引用學(xué)科排名




書目名稱Relational and Kleene-Algebraic Methods in Computer Science讀者反饋




書目名稱Relational and Kleene-Algebraic Methods in Computer Science讀者反饋學(xué)科排名

怕失去錢

Fixed-Point Characterisation of Winning Strategies in Impartial GamesWe use fixed-point calculus to characterise winning strategies in impartial, two-person games. A?byproduct is the fixed-point characterisation of winning, losing and stalemate positions. We expect the results to be most useful in teaching calculational reasoning about least and greatest fixed points.

Mercurial

glomeruli

秘方藥

Calculational Relation-Algebraic Proofs in Isabelle/IsarWe propose a?collection of theories in the proof assistant Isabelle/Isar that support calculational reasoning in and about heterogeneous relational algebras and Kleene algebras.

Wordlist

A Calculus of Typed RelationsA?calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style.

Inordinate

978-3-540-22145-6Springer-Verlag Berlin Heidelberg 2004

諂媚于性

Relational and Kleene-Algebraic Methods in Computer Science978-3-540-24771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

LAVE

Oratory

Towards a?Formalisation of Relational Database Theory in Constructive Type Theoryh successive formalisation is of more generality, and correspondingly more complex, than the previous one. All our work is carried out in the proof editor Alfa for Martin-L?f’s monomorphic type theory. Our goal is to obtain a formalisation that provides us with computational content, instead of just being a?completely abstract theory.