Search Results - Omloop~

Refine Results
  1. 2181
  2. 2182
  3. 2183
  4. 2184
  5. 2185
  6. 2186
  7. 2187

    Patterns for Beginning Programmers by Bernstein, David

    Published 2022
    Table of Contents: “…Patterns Requiring Knowledge of Loops, Arrays, and I/O -- IV. Patterns Requiring Advanced Knowledge of Arrays and Arrays of Arrays -- V. …”
    Access online version
    Electronic eBook
  8. 2188

    Foundations of Software Science and Computation Structures 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Sof...

    Published 2019
    Table of Contents: “…Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.…”
    Link to Metadata
    Electronic eBook
  9. 2189
  10. 2190
  11. 2191
  12. 2192
  13. 2193
  14. 2194
  15. 2195
  16. 2196
  17. 2197
  18. 2198
  19. 2199
  20. 2200