Conditional rewriting logic as a unified model of concurrency

Theoretical Computer Science

Volumn 96, Issue 1, 1992, Pages 73-155

  Meseguer, José ^a,b  

^a SRI INTERNATIONAL   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--FORMAL LOGIC;

CONCURRENT PROGRAMMING; DENOTATIONAL SEMANTICS; OPERATIONAL SEMANTICS; REWRITING LOGIC;

COMPUTER METATHEORY;

EID: 0027113376     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90182-F     Document Type: Article

References (126)

1. Explicit substitution
2. Concurrent programming using actors
3. Compiling concurrent rewriting onto the rewrite rule machine
4. Architectural design of the rewrite rule machine ensemble
5. LO and Behold! concurrent structured processes
6. A standard ML compiler
7. The GAMMA model and its discipline of programming
8. Graph expressions and graph rewriting
9. Characterization of computable data types by means of a finite equational specification method
10. The chemical abstract machine
11. Varieties of ordered algebras
12. Computational semantics of term rewriting systems
13. Towards a lambda calculus for concurrent and communicating systems
14. Permutation of transitions: an event structure semantics for CCS and SCCS
15. Natural semantics on the computer
16. An algebraic semantics of logic programs as structured transition systems
17. Infinite trees in normal form and recursive equations having a unique solution
18. The algebraic semantics of recursive program schemes
19. The categorical abstract machine
20. Axiomatizing net computations and processes
21. Rewrite systems
22. Infinite normal forms
23. Introduction to the algebraic theory of graph grammars
24. Net-based description of parallel object-based systems, or POTs and POPs
25. Parallel object-based systems and Petri nets, I and II
26. Aspects of topoi
27. Principles of OBJ2
28. Towards a geometry of interaction
29. On undecidable propositions of formal mathematical systems
30. Semantic specifications for the rewrite rule machine
31. Sheaf semantics for concurrent interacting objects
32. How to prove algebraic inductive hypotheses without induction: with applications to the correctness of data type representations
33. Operational semantics of order-sorted algebra
34. An introduction to OBJ3
35. Concurrent term rewriting as a model of computation
36. Unifying functional, object-oriented and relational programming with logical semantics
37. Unifying functional object-oriented and relational programming with logical semantics
38. Software for the rewrite rule machine
39. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
40. An initial algebra approach to the specification, correctness and implementation of abstract data types
41. Initial algebra semantics and continuous algebras
42. The parallel graph reduction machine Alice
43. A mathematical approach to nondeterminism in data types
44. Confluent reductions Abstract properties and applications to term rewriting systems
45. Super-combinators: a new implementation method for applicative languages
46. Actor grammars
47. Functional programming with sets
48. Target code generation from G-machine code
49. GRIP — a high-performance architecture for parallel graph reduction
50. Completion of a set of rules modulo a set of equations
51. Review of the elements of 2-categories
52. On “on graph rewritings”
53. The G-machine: a fast, graph-reduction evaluator
54. Operational semantics of OBJ3
55. General recursive functions of natural numbers
56. The linear abstract machine
57. Subequalizers
58. Deductive systems and categories II
59. Adjointness in foundations
60. Cell and ensemble architecture for the rewrite rule machine
61. Optimal reductions in the lambda calculus
62. An algebraic axiomatization of linear logic models
63. From Petri nets to linear logic
64. Varieties of chain-complete algebras
65. A Birkhoff-like theorem for algebraic classes of interpretations of program schemes
66. On order-complete universal algebra and enriched functorial semantics
67. General logics
68. A logical theory of concurrent objects
69. Rewriting as a unified model of concurrency
70. Initiality, induction and computability
71. Petri nets are monoids: A new algebraic foundation for net theory
72. Petri nets are monoids
73. Parallel programming in Maude
74. Functions as processes
75. A calculus of mobile processes I and II
76. On the interpretation of recursive program schemes
77. Survey of the equational logic programming project
78. Implementing term rewriting by graph reduction: Termination of combined systems
79. An abstract formulation of rewrite systems
80. Modeling concurrency with geometry
81. On graph rewritings
82. Operational and semantic equivalence between recursive programs
83. Foundations of equational deduction; A categorical treatment of equational proofs and unification algorithms
84. Modelling computations: a 2-categorical framework
85. Linear logic, *-autonomous categories and cofree coalgebras
86. Abstract object types: A temporal perspective
87. The family of concurrent logic programming languages
88. Concurrent transition systems
89. Fair termination is decidable for ground systems
90. Termination for the direct sum of term rewriting systems
91. Flagship: A parallel architecture for declarative programming