Introduction to higher order categorical logic
Introduction to higher order categorical logic
Notions of computation and monads
Information and Computation
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
An algebraic construction of predicate transformers
Science of Computer Programming - Special issue on mathematics of program construction
ALGOL-like languages (v.2)
Algebra of programming
Calculating sharp adaptation rules
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Predicate transformer semantics of a higher-order imperative language with record subtyping
Science of Computer Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Towards a Calculus of Predicate Transformers
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Towards squiggly refinement algebra
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Formal Derivation of CSP Programs From Temporal Specifications
MPC '95 Mathematics of Program Construction
Beyond Fun: Order and Membership in Polytypic Imperative Programming
MPC '98 Proceedings of the Mathematics of Program Construction
A categorical model for higher order imperative programming
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Journal of Functional Programming
Terms with unbounded demonic and angelic nondeterminacy
Science of Computer Programming
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Category Theoretic Models of Data Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assertion-based encapsulation, object invariants and simulations
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
Point-freerelation calculus and its categorical generalizations have been fruitful in development of calculi of functional programming, especially for general principles, e.g., polytypic patterns of recursion on inductive data. But in specific applications, pointwise formulations can be more convenient and comprehensible than point-free combinators. A typed lambda calculus including non-injective pattern-matching was given by de Moor and Gibbons, but their relational semantics has shortcomings. We give an alternative based on a categorical axiomatization of ideal relations. We give a second semantics based on predicate transformers, and show how the pattern construct offers a new integration of imperative and functional programming. Simulation results justify the semantics.