Programming as a Discipline of Mathematical Nature
From MaRDI portal
Publication:4773988
DOI10.2307/2319209zbMath0286.00013WikidataQ56047772 ScholiaQ56047772MaRDI QIDQ4773988
Publication date: 1974
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2319209
00A30: Philosophy of mathematics
68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science
Related Items
Unifying wp and wlp, Duality beyond sober spaces: Topological spaces and observation frames, Constraint preservation through loops, Predicate transformers and higher-order programs, Algebraic proofs of consistency and completeness, Embedding a demonic semilattice in a relation algebra, Formalizing Dijkstra's predicate transformer wp in weak second-order logic, Computable concurrent processes, Constructing a program with exceptions, A sheaf-theoretic approach to pattern matching and related problems, Complete proof rules for strong fairness and strong extreme fairness, On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data, Domain theory in logical form, Correctness of concurrent processes, Data refinement of predicate transformers, Combining angels, demons and miracles in program specifications, An execution mechanism for nondeterministic, state-oriented programs based on a chart parser, Verification of knowledge bases based on containment checking, Verifiable properties of database transactions, Quantitative semantics, topology, and possibility measures, MLOG: A strongly typed confluent functional language with logical variables, Nondeterminacy and recursion via stacks and games, Decentralized state feedback control of discrete event systems, A recursion theorem for predicate transformers on inductive data types, Formal specification of parallel SIMD execution, Procedures and atomicity refinement, The formal specification of abstract data types and their implementation in Fortran 90, An infinite pebble game and applications, Parallel constructions of maximal path sets and applications to short superstrings, The Spatial Semantic Hierarchy, Simplification of boolean verification conditions, Linear logic automata, Combining relational calculus and the Dijkstra-Gries method for deriving relational programs, Quasi-boolean equivalence, A relational division operator: The conjugate kernel, An inventory decision support system using the object oriented approach
