函数／逻辑程序设计语言RFUNILOG

本文提出了一种兼备函数／逻辑功能的程序设计语言ＲＦＵＮＬＯＧ。它不仅具有统一的语法形式和丰富的语言设施，而且有统一的操作语义，整个语言可以用图归约的概念来解释。     

ELNF演算的解释技术

ＥＬＮＦ演算是我们在ＬＮＦ演算的基础上扩充逻辑程序设计能力而得到的一种函数／逻辑演算系统，它构成了作者设计的函数／逻辑语言ＲＦＵＮＬＯＧ的基础．本文介绍ＥＬＮＦ演算的解释实现技术，包括数据结构、系统结构以及各个模块的设计思想．最后给出了在此解释系统下，几个典型程序的运行时间．     

CONSTRUCTING RECTANGULAR NURBS SURFACES IN TERMS OF THREE OF ITS FOUR BOUNDARY CURVES

ＣＯＮＳＴＲＵＣＴＩＮＧＲＥＣＴＡＮＧＵＬＡＲＮＵＲＢＳＳＵＲＦＡＣＥＳＩＮＴＥＲＭＳＯＦＴＨＲＥＥＯＦＩＴＳＦＯＵＲＢＯＵＮＤＡＲＹＣＵＲＶＥＳＷａｎｇＬａｚｈｕ；ＺｈｕＸｉｎｘｉｏｎｇＣＯＮＳＴＲＵＣＴＩＮＧＲＥＣＴＡＮＧＵＬＡＲＮＵＲＢＳＳＵＲ...     

A COUNTER－EXAMPLE TO A FAST ALGORITHM FOR FINDING THE CONVEX HULL OF A SIMPLE POLYGON

ＡＣＯＵＮＴＥＲ－ＥＸＡＭＰＬＥＴＯＡＦＡＳＴＡＬＧＯＲＩＴＨＭＦＯＲＦＩＮＤＩＮＧＴＨＥＣＯＮＶＥＸＨＵＬＬＯＦＡＳＩＭＰＬＥＰＯＬＹＧＯＮＧｏｄｆｒｉｅｄＴｏｕｓｓａｉｎｔＡＣＯＵＮＴＥＲ－ＥＸＡＭＰＬＥＴＯＡＦＡＳＴＡＬＧＯＲＩＴＨＭＦＯＲＦＩ...     

THE APPLICATION OF G~1 JOIN OF RECTANGULAR AND TRIANGULAR BEZIER PATCHES IN SURFACE MODELING

ＴＨＥＡＰＰＬＩＣＡＴＩＯＮＯＦＧ￣１ＪＯＩＮＯＦＲＥＣＴＡＮＧＵＬＡＲＡＮＤＴＲＩＡＮＧＵＬＡＲＢＥＺＩＥＲＰＡＴＣＨＥＳＩＮＳＵＲＦＡＣＥＭＯＤＥＬＩＮＧＷａｎｇＴｉａｎｊｕｎ；ＴａｎｇＲｏｎｇｘｉＳＭＯＯＴＨＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩ...     

A CONFIGURATION SYSTEM FOR FASTENER DESIGN（AN APPROACH TOWARDS COMPUTER AIDED CONCEPTUAL DESIGN）

ＡＣＯＮＦＩＧＵＲＡＴＩＯＮＳＹＳＴＥＭＦＯＲＦＡＳＴＥＮＥＲＤＥＳＩＧＮ（ＡＮＡＰＰＲＯＡＣＨＴＯＷＡＲＤＳＣＯＭＰＵＴＥＲＡＩＤＥＤＣＯＮＣＥＰＴＵＡＬＤＥＳＩＧＮ）ＧｕａｎｇＺｈｏｎｇ；ＭｉｋｅＤｏｏｎｅｒＡＣＯＮＦＩＧＵＲＡＴＩＯＮＳＹＳＴＥ...     

基于更新操作的含空值关系数据库中多种类信息的查询

基于更新操作的含空值关系数据库中多种类信息的查询马宗民（中国科学院沈阳自动化研究所沈阳１１００１５）ＱＵＥＲＹＩＮＧＩＮＦＯＲＭＡＴＩＯＮＳＯＦＤＩＦＦＥＲＥＮＴＫＩＮＤＳＵＮＤＥＲＵＰＤＡＴＥＯＰＥＲＡＴＩＯＮＳＩＮＲＥＬＡＴＩＯＮＡＬＤＡＴＡＢＡ...     

CAD系统二次开发语言的设计与实现

ＣＡＤ系统二次开发语言的设计与实现王建民，孙家广（清华大学计算机科学与技术系北京１０００８４）ＤＥＳＩＧＮＡＮＤＩＭＰＬＥＭＥＮＴＡＴＩＯＮＯＦＴＨＥＦＵＲＴＨＥＲＤＥＶＥＬＯＰＭＥＮＴＬＡＮＧＵＡＧＥＯＦＣＡＤＳＹＳＴＥＭＳ￥ＷａｎｇＪｉａｎｍｉｎ...     

FRAMEWORK OF A DISTRIBUTED ENGINEERING DBMS

ＦＲＡＭＥＷＯＲＫＯＦＡＤＩＳＴＲＩＢＵＴＥＤＥＮＧＩＮＥＥＲＩＮＧＤＢＭＳＷａｎｇＴａｏ；ＬｉｎＺｏｎｇｋａｉ；ＧｕｏＹｕｃｈａｉＳＭＯＯＴＨＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＯＶＥＲＡＲＢＩＴＲＡＲＹＴＲＩＡＮＧＵＬＡＴＩＯＮＳＢＹＳＵＢＤ...     

基于FORM的CGI程序的设计与应用

本文介绍了基于ＦＯＲＭ的ＣＧＩ程序的实现方法，它通过ＨＴＭＬ（ｈｙｐｅｒＴｅｘｔＭａｒｋｕｐＬａｎｇｕａｇｅ）超文本标记语言的数据集表ＦＯＲＭ接收用户的数据并将这些数据提交给服务器，服务器再将其传递给ＣＧＩ程序，ＣＧＩ程序对数据进行处理，并处理后的信息返回给浏览器或进行其它处理。     

Algebraic approach to linking the semantics of web services

Web services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. We have considered the operational semantics and denotational semantics for BPEL, where a set of algebraic laws can be achieved via these two models, respectively. In this paper, we consider the inverse work, deriving the operational semantics and denotational semantics from algebraic semantics for BPEL. In our model, we introduce four types of typical programs, by which every program can be expressed as the summation of these four types. Based on the algebraic semantics, the strategy for deriving the operational semantics is provided and a transition system is derived by strict proof. This can be considered as the soundness exploration for the operational semantics based on the algebraic semantics. Further, the equivalence between the derivation strategy and the derived transition system is explored, which can be considered as the completeness of the operational semantics. Finally, the derivation of the denotational semantics from algebraic semantics is explored, which can support to reason about more program properties easily.     

Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language

Complex software systems typically involve features like time, concurrency and probability, with probabilistic computations playing an increasing role. However, it is currently challenging to formalize languages incorporating all those features. Recently, the language PTSC has been proposed to integrate probability and time with shared-variable concurrency (Zhu et al. (2006, 2009) [51] and [53]), where the operational semantics has been explored and a set of algebraic laws has been investigated via bisimulation. This paper investigates the link between the operational and algebraic semantics of PTSC, highlighting both its theoretical and practical aspects.The link is obtained by deriving the operational semantics from the algebraic semantics, an approach that may be understood as establishing soundness of the operational semantics with respect to the algebraic semantics. Algebraic laws are provided that suffice to convert any PTSC program into a form consisting of a guarded choice or an internal choice between programs, which are initially deterministic. That form corresponds to a simple execution of the program, so it is used as a basis for an operational semantics. In that way, the operational semantics is derived from the algebraic semantics, with transition rules resulting from the derivation strategy. In fact the derived transition rules and the derivation strategy are shown to be equivalent, which may be understood as establishing completeness of the operational semantics with respect to the algebraic semantics.That theoretical approach to the link is complemented by a practical one, which animates the link using Prolog. The link between the two semantics proceeds via head normal form. Firstly, the generation of head normal form is explored, in particular animating the expansion laws for probabilistic interleaving. Then the derivation of the operational semantics is animated using a strategy that exploits head normal form. The operational semantics is also animated. These animations, which again supports to claim soundness and completeness of the operational semantics with respect to the algebraic, are interesting because they provide a practical demonstration of the theoretical results.     

Semantics of plan revision in intelligent agents

In this paper, we give an operational and denotational semantics for a meta-language of the 3APL agent programming language. With this meta-language, various 3APL interpreters can be programmed. We prove equivalence of the operational and denotational semantics. Furthermore, we give an operational semantics for object-level 3APL. Using this semantics, we relate the 3APL meta-language to object-level 3APL by providing a specific interpreter, the semantics of which will prove to be equivalent to object-level 3APL.     

χ-演算与π-演算的语义比较研究

Through the comparison of syntactic structure,operational semantics and algebraic semantics between χ-calculus and π-calculus, this paper concludes that χ-calculus has more succinct syntactic structure,more explicit operational semantics,more intuitionistic algebraic semantics and more favorable algebraic property. And a translation from π-calculus to χ-calculus is presented.     

A structural operational semantics for an Edison-like language (1)

A structural operational semantics for Edison. 1—an Edison-like language—is given. The static and dynamic (operational) semantics for various declarations and statements contained in this type of languages have been carefully studied by using a structural operational approach. The method used here can be generalised to cover more complicated concurrent programming languages. The paper is divided into two parts. In the first part, an abstract syntax of Edison. 1 is introduced and the static semantics of it is studied. In the second part, an operational (dynamic) semantics of Edison. 1 is given.     

Towards a theory of mathematical operational semantics

Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics in their paper “Towards a mathematical operational semantics.” Starting from that definition and at the level of generality of that definition, we give a mathematical formulation of some of the basic constructions one makes with structural operational semantics. In particular, given a single-step operational semantics, as is the spirit of their work, one composes transitions and considers streams of transitions in order to study the dynamics induced by the operational semantics. In all their leading examples, it is obvious that one can do that and it is obvious how to do it. But if their definition is to be taken seriously, one needs to be able to make such constructions at the level of generality of their definition rather than case-by-case. So this paper does so for several of the basic constructions associated with structural operational semantics, in particular those required in order to speak of a stream of transitions and hence of dynamics.     

Semantic theories of programs with nested interrupts

In the design of dependable software for embedded and real-time operating systems, time analysis is a crucial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important and challenging. In this paper, we present a programming language to describe programs with interrupts that is comprised of two essential parts: main program and interrupt handling programs. We also explore a timed operational semantics and a denotational semantics to specify the meanings of our language. Furthermore, a strategy of deriving denotational semantics from the timed operational semantics is provided to demonstrate the soundness of our operational semantics by showing the consistency between the derived denotational semantics and the original denotational semantics.     

A rewriting logic framework for operational semantics of membrane systems

Existing results in membrane computing refer mainly to P systems’ characterization of Turing computability, also to some polynomial solutions to NP-complete problems by using an exponential workspace created in a “biological way”. In this paper we define an operational semantics of a basic class of P systems, and give two implementations of the operational semantics using rewriting logic. We present some results regarding these implementations, including two operational correspondence results, and discuss why these implementations are relevant in order to take advantage of good features of both structural operational semantics and rewriting logic.     

Contributions to the semantics of logic perpetual processes

Summary Logic perpetual processes (logic programs with infinite data structures) have been given several formal (operational and fixpoint) semantics. In this paper, we compare the various semantics and define a formal characterization of a least fixpoint semantics, which is based on a modified version of the logic programs and which is satisfactory for a large class of logical perpetual processes. Our results show that all the proposed fixpoint semantics are not equivalent to the operational semantics and suggest an improvement of the least fixpoint approach.