In Search of Elegance in the Theory and Practice of Computation [[electronic resource] ] : Essays dedicated to Peter Buneman / / edited by Val Tannen, Limsoon Wong, Leonid Libkin, Wenfei Fan, Wang-Chiew Tan, Michael Fourman
| In Search of Elegance in the Theory and Practice of Computation [[electronic resource] ] : Essays dedicated to Peter Buneman / / edited by Val Tannen, Limsoon Wong, Leonid Libkin, Wenfei Fan, Wang-Chiew Tan, Michael Fourman |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 569 p. 121 illus.) |
| Disciplina | 005.74 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Database management
Compilers (Computer programs) Computer science Database Management Compilers and Interpreters Computer Science Logic and Foundations of Programming |
| ISBN | 3-642-41660-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models for Data-Centric Workflows -- Relational Databases and Bell’s Theorem -- High-Level Rules for Integration and Analysis of Data: New Challenges -- A New Framework for Designing Schema Mappings -- User Trust and Judgments in a Curated Database with Explicit Provenance -- An Abstract, Reusable, and Extensible Programming Language Design Architecture -- A Discussion on Pricing Relational Data -- Tractable Reasoning in Description Logics with Functionality Constraints -- Toward a Theory of Self-explaining Computation -- To Show or Not to Show in Workflow Provenance -- Provenance-Directed Chase and Backchase -- Data Quality Problems beyond Consistency and Deduplication -- Hitting Buneman Circles -- Looking at the World Thru Colored Glasses -- Static Analysis and Query Answering for Incomplete Data Trees with Constraints -- Using SQL for Efficient Generation and Querying of Provenance Information -- Bounds and Algorithms for Joins via Fractional Edge Covers -- Incremental Data Fusion Based on Provenance Information -- Provenance for Linked Data -- First-Order Provenance Games -- Querying an Integrated Complex-Object Dataflow Database -- Types, Functional Programming and Atomic Transactions in Hardware Design -- Record Polymorphism: Its Development and Applications -- A Calculus of Chemical Systems -- Schemaless Semistructured Data Revisited - Reinventing Peter Buneman’s Deterministic Semistructured Data Model -- Provenance Propagation in Complex Queries -- Well-Defined NRC Queries Can Be Typed -- Nine Years with Peter Buneman -- Modal Logic for Preference Based on Reasons -- The Dichotomous Intensional Expressive Power of the Nested Relational Calculus with Powerset -- Provenance in a Modifiable Data Set. |
| Record Nr. | UNISA-996465410003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
In Search of Elegance in the Theory and Practice of Computation : Essays dedicated to Peter Buneman / / edited by Val Tannen, Limsoon Wong, Leonid Libkin, Wenfei Fan, Wang-Chiew Tan, Michael Fourman
| In Search of Elegance in the Theory and Practice of Computation : Essays dedicated to Peter Buneman / / edited by Val Tannen, Limsoon Wong, Leonid Libkin, Wenfei Fan, Wang-Chiew Tan, Michael Fourman |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 569 p. 121 illus.) |
| Disciplina | 005.74 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Database management
Compilers (Computer programs) Computer science Database Management Compilers and Interpreters Computer Science Logic and Foundations of Programming |
| ISBN | 3-642-41660-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models for Data-Centric Workflows -- Relational Databases and Bell’s Theorem -- High-Level Rules for Integration and Analysis of Data: New Challenges -- A New Framework for Designing Schema Mappings -- User Trust and Judgments in a Curated Database with Explicit Provenance -- An Abstract, Reusable, and Extensible Programming Language Design Architecture -- A Discussion on Pricing Relational Data -- Tractable Reasoning in Description Logics with Functionality Constraints -- Toward a Theory of Self-explaining Computation -- To Show or Not to Show in Workflow Provenance -- Provenance-Directed Chase and Backchase -- Data Quality Problems beyond Consistency and Deduplication -- Hitting Buneman Circles -- Looking at the World Thru Colored Glasses -- Static Analysis and Query Answering for Incomplete Data Trees with Constraints -- Using SQL for Efficient Generation and Querying of Provenance Information -- Bounds and Algorithms for Joins via Fractional Edge Covers -- Incremental Data Fusion Based on Provenance Information -- Provenance for Linked Data -- First-Order Provenance Games -- Querying an Integrated Complex-Object Dataflow Database -- Types, Functional Programming and Atomic Transactions in Hardware Design -- Record Polymorphism: Its Development and Applications -- A Calculus of Chemical Systems -- Schemaless Semistructured Data Revisited - Reinventing Peter Buneman’s Deterministic Semistructured Data Model -- Provenance Propagation in Complex Queries -- Well-Defined NRC Queries Can Be Typed -- Nine Years with Peter Buneman -- Modal Logic for Preference Based on Reasons -- The Dichotomous Intensional Expressive Power of the Nested Relational Calculus with Powerset -- Provenance in a Modifiable Data Set. |
| Record Nr. | UNINA-9910484913303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to Computation : Haskell, Logic and Automata / / by Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
| Introduction to Computation : Haskell, Logic and Automata / / by Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler |
| Autore | Sannella Donald |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Springer Nature, 2022 |
| Descrizione fisica | 1 online resource (371 pages) |
| Disciplina | 004.015113 |
| Collana | Undergraduate Topics in Computer Science |
| Soggetto topico |
Computer science
Computer science - Mathematics Algorithms Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Design and Analysis of Algorithms |
| ISBN | 3-030-76908-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Sets -- 2. Types -- 3. Simple Computations -- 4. Venn Diagrams and Logical Connectives -- 5. Lists and Comprehensions -- 6. Features and Predicates -- 7. Testing Your Programs -- 8. Patterns of Reasoning -- 9. More Patterns of Reasoning -- 10. Lists and Recursion -- 11. More Fun with Recursion -- 12. Higher-Order Functions -- 13. Higher and Higher -- 14. Sequent Calculus -- 15. Algebraic Data Types -- 16. Expression Trees -- 17. Karnaugh Maps -- 18. Relations and Quantifiers -- 19. Checking Satisfiability -- 20. Data Representation -- 21. Data Abstraction -- 22. Efficient CNF Conversion -- 23. Counting Satisfying Valuations -- 24. Type Classes -- 25. Search in Trees -- 26. Combinatorial Algorithms -- 27. Finite Automata -- 28. Deterministic Finite Automata -- 29. Non-Deterministic Finite Automata -- 30. Input/Output and Monads -- 31. Regular Expressions -- 32 Non-Regular Languages -- Index. |
| Record Nr. | UNINA-9910520082703321 |
Sannella Donald
|
||
| Springer Nature, 2022 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||