Concurrent calculus (CC) is a mathematical model for higher-order concurrent and communicating systems. Compared with the existing calculi such as CCS, CMP, CHOCS etc., CC includes λ-calculus as its subtheory and emb...Concurrent calculus (CC) is a mathematical model for higher-order concurrent and communicating systems. Compared with the existing calculi such as CCS, CMP, CHOCS etc., CC includes λ-calculus as its subtheory and embodies most important characteristics of CCS and other calculi. CC treats processes and communicating ports as firstclass objects, that is to say, both of them can be sent and received during communication. Besides, the communicating ports in CC-processes are allowed to be any expressions. This paper presents the syntax and semantics of CC first, some examples are given which illustrate the expressing power of CC. Then we study the hlgh-order bisimulation equivalence of CC-processes and the algebraic laws of CC. The summation operator "+" in CC has the same meaning as that in other calculi. Following the principle that only environment can determiue the evolution direction of summation process, this paper also provides a new semantics of summation operator "+", which is different from the semantics of summation in CCS, CMP, and CHOCS. CC has some expected algebraic properties under this new semantics of summation.展开更多
Many reduction systems have been presented for implementing functional programming languages. We propose here an extension of a reduction architecture to realize a kind of logic programming——pure Horn clause logic p...Many reduction systems have been presented for implementing functional programming languages. We propose here an extension of a reduction architecture to realize a kind of logic programming——pure Horn clause logic programming.This is an attempt to approach amalgama- tion of the two important programming paradigms.展开更多
基金Project supported by a grant from the National Natural Science Foundation of China and HiTech Developing ("863") Program.
文摘Concurrent calculus (CC) is a mathematical model for higher-order concurrent and communicating systems. Compared with the existing calculi such as CCS, CMP, CHOCS etc., CC includes λ-calculus as its subtheory and embodies most important characteristics of CCS and other calculi. CC treats processes and communicating ports as firstclass objects, that is to say, both of them can be sent and received during communication. Besides, the communicating ports in CC-processes are allowed to be any expressions. This paper presents the syntax and semantics of CC first, some examples are given which illustrate the expressing power of CC. Then we study the hlgh-order bisimulation equivalence of CC-processes and the algebraic laws of CC. The summation operator "+" in CC has the same meaning as that in other calculi. Following the principle that only environment can determiue the evolution direction of summation process, this paper also provides a new semantics of summation operator "+", which is different from the semantics of summation in CCS, CMP, and CHOCS. CC has some expected algebraic properties under this new semantics of summation.
基金This work was done by the author when he was a visiting researcher in the research group of Prof.Dr.Werner Kluge at Kiel University,supported by the grant of Federal M ster of Science and Technology of Germany.
文摘Many reduction systems have been presented for implementing functional programming languages. We propose here an extension of a reduction architecture to realize a kind of logic programming——pure Horn clause logic programming.This is an attempt to approach amalgama- tion of the two important programming paradigms.
