The laws of programming unify process calculi
| Autor: | Stephan van Staden, Tony Hoare |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Algebraic laws
Unification Computer science Semantics (computer science) Science and engineering Process calculus ComputingMilieux_LEGALASPECTSOFCOMPUTING Basis (universal algebra) Hoare logic Operational semantics Meaning (philosophy of language) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Sequential programming TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science Law Actor model and process calculi Computer Science::Programming Languages Concurrent computing Algebra over a field Software Mathematics |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783642311123 MPC |
| ISSN: | 0167-6423 |
| DOI: | 10.1016/j.scico.2013.08.012 |
| Popis: | We survey the well-known algebraic laws of sequential programming, and propose some less familiar laws for concurrent programming. On the basis of these laws, we derive the rules of a number of classical programming and process calculi, for example, those due to Hoare, Milner, and Kahn. The algebraic laws are simpler than each of the calculi derived from it, and they are stronger than all the calculi put together. Conversely, most of the laws are derivable from one or more of the calculi. This suggests that the laws are useful as a presentation of program semantics, and correspond to a widely held common understanding of the meaning of programs. For further evidence, Appendix A describes a realistic and generic model of program behaviour, which has been proved to satisfy the laws. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect