合成语言FOPL实现注记

合成语言ＦＯＰＬ是笔者设计并实现的一种同时支持函数式程序设计风格和面向对象程序设计风格的语言。本文主要讨论ＦＯＰＬ语言的实现技术。     

函数式面向对象语言FOPL的指称语义

函数式面向对象程序设计语言ＦＯＰＬ是笔者设计并实现的一种合成语言，本文在一个全称的抽象域上描述了ＦＯＰＬ语言的指称语义。     

利用.PLT文件和PLOT绘制工程图形

ＰＬＯＴ是ＳＵＲＦＥＲ软件中一个图形输出程序，．ＰＬＴ文件则是由ＴＯＰＯ和ＳＵＲＦ形成的绘图文件。在ＳＵＲＦＥＲ绘图过程中发现，ＰＬＴ文件是由一组绘图命令组合的。根据其结构可以用高级语言编制类型众多的绘图程序，扩展了ＳＵＲＦＥＲ的绘图功能。本文就．ＰＬＴ文件的形成和ＰＬＯＴ绘制图形作了探讨。     

OOP的计算模型研究

虽然ＯＯＰ（面向对象程序）已得到广泛应用，但由于ＯＯＰＬ）面向对象程序设计语言）、ＯＯＴ（面向对象技术）还缺乏坚实的理论基础，致使早期ＯＯＰＬ在对象、类、继承性和方法等面向对象的基本概念及其语义方面还缺乏一些致性表示和定义。本文作者在我媒体软件和大型信息系统开发实践中，详细分析了几种不同的ＯＯＰＬ语言，提出了ＯＯＰ的计算模型ＯＯＣＭ。ＯＯＣＭ从形式上定义了面向对象的基本概念、相关语义及其计算特征     

ELNF演算的解释技术

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

KBASE－P知识库系统的设计与实现

当前的实用知识库系统研究是将知识库查询语言嵌入到一个过程语言中．ＫＢＡＳＥ－Ｐ是一个通用的知识库程序设计语言．ＫＢＡＳＥ－Ｐ以ＫＢＡＳＥ作为查询语言，以ＦＤ－ＰＲＯＬＯＧ（我们开发的一个ＰＲＯＬＯＧ扩充）为过程性的宿主语言执行１／Ｏ和ＤＢ更新操作（用扩充的内部谓词）．由于良好的设计和实现，查询语言与宿主语言之间的阻抗不匹配问题相对较小．因而，ＫＢＡＳＥ－Ｐ是一个比较实用的知识库程序设计语言．ＫＢＡＳＥ－Ｐ系统支持逻辑程序设计语言（ＫＢＡＳＥ－Ｐ语言）的程序开发，提供了文本编辑、文件管理、谓词管理、事实操作、Ｄａｔａｌｏｇ查询、ＳＱＬ查询等功能．本文详细介绍了ＫＢＡＳＥ－Ｐ系统的设计和实现．     

带迭代算子的函数式程序设计

本文提出了程序设计语言的一种新的计算模型，带迭代处子的函数式模型，文中给出了基于该计算模型的程序设计语言的语法、计算规则集及确定怀证明，该类语言以表达式的复合描述顺序，以迭代表达式描述循环，以条件表达式描述分支，使得程序以数学语义为基础，易于理解，证明及构造高效的执行系统，相信该类语言是一咱有坚实理论基础、高效的、实际有用的高级确定性程序设计语言。     

函数式面向对象程序设计语言FOPL

本文介绍函数式面向对象程序设计语言ＦＯＰＬ的设计原则、主要特性及实现等方面的问题。     

FOXPRO2.5 FOR DOS下一个通用,灵活的授权程序设计

本文介绍了在ＦＯＸＰＲＯ２．５ ＦＯＲ ＤＯＳ环境下编写一个通用、灵活的授权程序的方法，并给出了设计中的关键程序段。     

Sun C语言与Sun FORTRAN混合编程技术

Ｓｕｎ的ｃ语言与Ｆｏｒｔｒａｎ语言可以相互调用，灵活地使用可以充分发挥两种语言的优势，并能大大地提高工作效率。本文介绍ＦＯＲＴＲＡＮ程序如何调用Ｃ程序以及Ｃ程序如何调用ＦＯＲＴＲＡＮ程序，给出了在Ｓｕｎ工作站上通过的例子。     

Dynamic composition of parameterised logic modules

We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of definite clauses which may contain formulae of the form A in Pexp, where A is a standard atomic formula and Pexp is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two different equivalent styles. An operational, top-down semantics is given by means of inference rules, while a denotational, bottom-up semantics is given via an immediate consequence operator associated with program expressions. A meta-programming implementation of the language is also presented by transforming the operational inference rules into meta-level axioms. Several programming examples are discussed to illustrate the expressive power of the language.     

Agent Programming in 3APL

An intriguing and relatively new metaphor in the programming community is that of an intelligent agent. The idea is to view programs as intelligent agents acting on our behalf. By using the metaphor of intelligent agents the programmer views programs as entities which have a mental state consisting of beliefs and goals. The computational behaviour of an agent is explained in terms of the decisions the agent makes on the basis of its mental state. It is assumed that this way of looking at programs may enhance the design and development of complex computational systems.To support this new style of programming, we propose the agent programming language 3APL. 3APL has a clear and formally defined semantics. The operational semantics of the language is defined by means of transition systems. 3APL is a combination of imperative and logic programming. From imperative programming the language inherits the full range of regular programming constructs, including recursive procedures, and a notion of state-based computation. States of agents, however, are belief or knowledge bases, which are different from the usual variable assignments of imperative programming. From logic programming, the language inherits the proof as computation model as a basic means of computation for querying the belief base of an agent. These features are well-understood and provide a solid basis for a structured agent programming language. Moreover, on top of that 3APL agents use so-called practical reasoning rules which extend the familiar recursive rules of imperative programming in several ways. Practical reasoning rules can be used to monitor and revise the goals of an agent, and provide an agent with reflective capabilities.Applying the metaphor of intelligent agents means taking a design stance. From this perspective, a program is taken as an entity with a mental state, which acts pro-actively and reactively, and has reflective capabilities. We illustrate how the metaphor of intelligent agents is supported by the programming language. We also discuss the design of control structures for rule-based agent languages. A control structure provides a solution to the problem of which goals and which rules an agent should select. We provide a concrete and intuitive ordering on the practical reasoning rules on which such a selection mechanism can be based. The ordering is based on the metaphor of intelligent agents. Furthermore, we provide a language with a formal semantics for programming control structures. The main idea is not to integrate this language into the agent language itself, but to provide the facilities for programming control structures at a meta level. The operational semantics is accordingly specified at the meta level, by means of a meta transition system.     

Reactive C: An extension of C to program reactive systems

Reactive systems are interactive programs that react continuously to sequences of activations coming from the external world. Reactive programming leads to a new programming style where one programs in terms of reactions to activations and reasons in a logic of instants. This paper describes an extension of the C programming language called RC (for ‘Reactive C’) to program reactive systems. The language RC is described, then some programming examples are given to illustrate the reactive approach. The main RC notions come directly from the Esterel synchronous programming language. Finally, the Esterel and RC languages are compared.     

CC$:一种面向分布式众核平台的并行编程语言

CC$是一种并行编程语言,目的是解决分布式众核并行计算机的编程困难。CC$的编程模型以Multi BSP 模型为基础,将分布式众核并行计算机的硬件架构抽象为3层。数据按照存储的层次和共享范围分为5类,以便在不 同层次上提供共享。LL$还提出一类虚拟指令来解决不同层次之间的数据交换,实现数据访问的逻辑化描述。并行 程序按照3层Multi BSP超步嵌套执行。CC$具有统一的编程风格、内建的多层会共地址空间、数据访问请求的表达 式描述和数据传输编译优化4大特点。测试表明,CC$程序的运行效率高,易学易用,大幅地缩短了开发周期。     

巧记C语言运算符优先级

C语言中的运算符优先级关系复杂难记,结合编程和教学实践,给出了C语言运算符优先级的巧记规则,辅以实例加以说明。     

Rule-Based Programming with Diaplan

Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall illustrate how Diaplan supports a functional and object-oriented style of programming. The example also indicates which features are needed beyond those discussed in previous work on the language [B. Hoffmann, Abstraction and control for shapely nested graph transformation, Fundamenta Informaticae 58 (2003) 39–56].     

Programming by successive refinement of data abstractions

The Model Programming Language implements a form of data abstraction that has been used in a large programming project, the Demos Operating System. The use of the abstraction mechanism suggests a particular programming style that has evolved over an extensive period of gaining experience with the language. The programming style and Model's approach to data abstraction are both documented here using an example designed to illustrate several of the more important issues. The goal of the paper is to demonstrate a programming style and an approach to data abstraction in a programming language that has proved useful in a significant systems programming application.