𝔖 Bobbio Scriptorium

✦ LIBER ✦

Relational and algebraic methods in computer science

✍ Scribed by de Swart, Harrie

Book ID: 119299321
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 168 KB
Volume: 81
Category: Article
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2012.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Continuous Relations and Richardson’s Theorem

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 234 KB

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Extension Properties of Boolean Contact Algebras

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 278 KB

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Relation Algebras, Matrices, and Multi-valued Decision Diagrams

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 259 KB

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Towards Certifiable Implementation of Graph Transformation via Relation Categories

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 295 KB

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 263 KB

[Lecture Notes in Computer Science] Rela

[Lecture Notes in Computer Science] Relational and Algebraic Methods in Computer Science Volume 7560 || Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings

✍ Kahl, Wolfram; Griffin, Timothy G. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 262 KB