The Laws of Programming Unify Process Calculi

The Laws of Programming Unify Process Calculi

Bibliografske podrobnosti
Main Authors:	Hoare, T, van Staden, S
Format:	Conference item
Izdano:	Springer 2012

Podobne knjige/članki

Algebra Unifies Operational Calculi
od: van Staden, S, et al.
Izdano: (2012)

Normal Forms for Synchronous and Asynchronous Process Calculi
od: Hoare, T, et al.
Izdano: (2000)

Program design calculi /
od: Broy, Manfred
Izdano: (1993)

On the Semantics of Refinement Calculi
od: Yang, H, et al.
Izdano: (2015)

Unified Theories of Programming
od: Hoare, C
Izdano: (2015)

Non-classical propositional calculi
od: McCall, S, et al.
Izdano: (1964)

Graphical calculi and their conjecture synthesis
od: Miller-Bakewell, H
Izdano: (2020)

Completeness of the ZW and ZX calculi
od: Ng, K
Izdano: (2018)

Heuristic principles and logical calculi /
od: 323486 Serebryannikov, Oleg Fedorovich
Izdano: (1972)

Unifying Semantics for Concurrent Programming
od: Hoare, T
Izdano: (2013)

Unifying theories of programming
od: He, J, et al.
Izdano: (1998)

Typed non-determinism in functional and concurrent calculi
od: van den Heuvel, B, et al.
Izdano: (2023)

Integrating Action Calculi and Description Logics
od: Drescher, C, et al.
Izdano: (2007)

Bounded functional calculi for unbounded operators
od: Batty, C, et al.
Izdano: (2023)

Unifying Theories for Parallel Programming
od: Hoare, C, et al.
Izdano: (1997)

Process Algebra: A Unifying Approach
od: Hoare, C
Izdano: (2004)

Product formulas in functional calculi for sectorial operators
od: Batty, C, et al.
Izdano: (2014)

Fundamentals of uncertainty calculi with applications to fuzzy inference /
od: 431952 Grabisch, Michel, et al.
Izdano: (1995)

In praise of algebra
od: Hoare, T, et al.
Izdano: (2012)

Linear realizability and full completeness for typed lambda−calculi
od: Abramsky, S, et al.
Izdano: (2005)

Internal proof calculi for modal logics with separating conjunction
od: Demri, S, et al.
Izdano: (2021)

More results about differential calculi on the quantum superplane /
od: 320061 El Hassouni, A., et al.
Izdano: (1995)

Functional calculi for sectorial operators and related function theory
od: Batty, CJK, et al.
Izdano: (2021)

A Decomposition Rule for Decision Procedures by Resolution-Based Calculi.
od: Hustadt, U, et al.
Izdano: (2004)

Categorical abstract machines for higher-order typed lambda-calculi
od: Ritter, E
Izdano: (1994)

Generic Models of the Laws of Programming
od: Hoare, T
Izdano: (2013)

Analysis of urinary calculi by physical methods in Hospital Universiti Sains Malaysia
od: Zainuddin, Saiful Azli Mohd
Izdano: (2010)

Comments on: Comparison of three different endoscopic techniques in management of bladder calculi
od: Kamarulzaman, Mohd Nazli
Izdano: (2011)

Towards a Formal Distributional Semantics: Simulating Logical Calculi with Tensors
od: Grefenstette, E
Izdano: (2013)

Concurrency theory : calculi an automata for modelling untimed and timed concurrent systems /
od: 180279 Bowman, Howard, et al.
Izdano: (2006)

Laws of Occam Programming
od: Roscoe, A, et al.
Izdano: (1986)

The Laws of Occam Programming
od: Roscoe, A, et al.
Izdano: (1988)

The laws of occam programming
od: Roscoe, A, et al.
Izdano: (1988)

Laws of programming with concurrency (Invited Talk)
od: Hoare, T
Izdano: (2013)

Unifying Models of Data Flow
od: Hoare, T, et al.
Izdano: (2011)

Unifying Theories : A Personal Statement
od: Hoare, C
Izdano: (1996)

Unifying theories of healthiness condition
od: He, J, et al.
Izdano: (2000)

The enterprise unified process : extending the rational unified process /
od: Ambler, Scott W., 1966-, et al.
Izdano: (2005)

Cystic calculi removal in African spurred tortoise (Geochelone sulcata) using transplstron coeliotomy
od: Che' Amat, Azlan, et al.
Izdano: (2012)

Implicit automata in typed λ-calculi I: Aperiodicity in a non-commutative logic
od: Nguyễn, LTD, et al.
Izdano: (2020)