A model for the formal definition of programming languages

An operational model which allows the complete formal definition of the full syntax and, particularly, semantics of programming languages is described. Both its syntactic and semantic parts are based on so-called linked-forest manipulation systems which allow the definition of mappings on forests. The idea of “linking” is crucial for the given model, we represent not only abstract programs but also intermediate states of our system (abstract computer) by labelled forests with pointers.     

智能Agent程序设计语言IAPL

分析了现有的面向Agent程序设计语言,指出了各自的优缺点。基于智能Agent结构,设计了一个新的智能Agent程序设计语言IAPL;给出了IAPL的语言规范、一组操作原语(信念、意向等心智成份的增加、删除、修改、查询等原语)及Agent之间的通信原语;利用情境演算理论,提供了IAPL语言的语义;提出了在线执行与离线规划相结合的IAPL程序执行方式。     

Toward an abstract theory of data compression

This paper extends the usual notion of abstract program size complexity, studied by Kolmogorov, Chaitin and others, to a theory that can better model the concept of a ‘practical’ compression method. The contraction of a string is defined, as in standard program size complexity, to be the shortest program which produces that string. However, this is in general an undecidable problem. Here, a model for an abstract compression ‘scheme’ is proposed. An abstract compression scheme not only allows the programming language and cost function to be specified, but also a restricted domain of programs that may be used as compressed forms. Limitations and inherent trade-offs are discussed and a class of ‘good’ schemes is considered.     

Abstract interpretation of resolution-based semantics

We extend the abstract interpretation point of view on context-free grammars by Cousot and Cousot to resolution-based logic programs and proof systems. Starting from a transition-based small-step operational semantics of Prolog programs (akin to the Warren Machine), we consider maximal finite derivations for the transition system from most general goals. This semantics is abstracted by instantiation to terms and furthermore to ground terms, following the so-called c- and s-semantics approach. Orthogonally, these sets of derivations can be abstracted to SLD-trees, call patterns and models, as well as interpreters providing effective implementations (such as Prolog). These semantics can be presented in bottom–up fixpoint form. This abstract interpretation-based construction leads to classical bottom–up semantics (such as the s-semantics of computed answers, the c-semantics of correct answers of Keith Clark, and the minimal-model semantics of logical consequences of Maarten van Emden and Robert Kowalski). The approach is general and can be applied to infinite and top–down semantics in a straightforward way.     

An abstract programming language and correctness proofs

The realization of an abstract programming language is a good approach for automating the software production process and facilitating the correctness proof of a software system.

This paper introduces a formal language for programming at the abstract level by combining Pascal with VDM (Vienna Development Method). The notation provided by the language obliges programmers to consider the correctness of programs throughout the whole process of programming, and the proof axiom and rules presented in this paper may be used to prove the correctness of programs. A complete example is given to illustrate how to program using APL and how to prove the correctness of programs using the given axiom and rules.     

基于AST的程序静态分析工具的研究与实现

本文给出了以抽象语法树为基础的软件静态分析工具的体系结构，介绍了该工具中各个模块的设计与实现方法，着重于规则库的设计，以及利用定义好的规则实现自动化的代码检测的过程。     

Syntax and Semantics for a Fuzzy Temporal Constraint Logic

In this paper we establish the relationship between the syntax and semantics of a fuzzy temporal constraint logic (FTCL) proposed by Cárdenas et al. FTCL enables us to express interrelated events by means of fuzzy temporal constraints. Moreover, it provides a resolution principle for performing inferences which take these constraints into account. FTCL is compatible with the theoretical temporal reasoning model proposed by Marín et al. – the Fuzzy Temporal Constraint Networks (FTCN). The main contributions of this paper are, on the one hand, the proofs of the FTCL-deduction and the FTCL-refutation theorems, and, on the other, the proof of the soundness of the refutation by resolution in this formal system, together with an exhaustive study of its completeness.     

Design of an arabic programming language (ARABLAN)

It was observed that school children in Arab countries find difficulty in learning programming in a language other than their native language. There are only few Arabic programming languages in the literature; most of which are never or partially implemented. In this paper, we present the design of a new Arabic programming language (ARABLAN) which is planned to be implemented for use in teaching programming for school children in Arab countries.     

一种上下文无关语言语法树的存储模式及其应用

针对上下文无关语言的句子所对应的语法树G树的表示形式提出了一种关系数据库的存储形式.这种存储形式的优点是：表示形式一致;句子分析简单;语句执行速度快.这种存储形式作为一种上下文无关语言的中间语言的形式可以直接交付解释器（抽象机）执行.同时介绍基于这种表示形式的上下文无关句子的编辑器.编辑器是基于Web的交互式语法制导生成方式实现的.这种表示与存储形式被用于一种描述过程性知识的函数式语言.     

可逆编程语言R-JAVA及其语言处理系统的设计

为了给基于可逆逻辑综合、可逆电路技术的可逆硬件平台设计可逆软件系统,提出基于JDK的可逆编程语言RJAVA.首先总结可逆编程语言的设计原则,然后为可逆语言R-JAVA设计文法规则和语言处理系统,其语言处理系统提取源程序中的可逆代码段并将其翻译成分别对应正反语义的等价JAVA代码,再将翻译后的JAVA代码交由JDK解释执行.最后通过示例程序表明R-JAVA源程序中的可逆函数既可正向运行,又可反向运行,从软件层次上实现了可逆计算.     

Integration of object-oriented programming languages and database systems in KOPERNIK

KOPERNIK is an object-oriented database system, that allows uniform specification of database requests and application programs. The user interface is based on Smalltalk, and the object-oriented data model is represented in terms of classes and messages. Techniques are discussed for implementing such a model on top of an underlying relational database system. Those parts of application programs that cannot be translated into a relational language are handled by a Smalltalk processor. The semantics of the database requests is defined in terms of a meta-model and meta-messages, using an object-oriented approach. Hence we derive rules for translation of database requests into SQL queries over a binary relational view, introduced as an intermediate level between the underlying database and our conceptual view.     

Smalltalk—80的基本概念和抽象文法

Smalltalk—80是原型的面向对象程序设计语言和环境,其中所体现的面向对象方法学已广泛应用于计算机科学的各个领域。我们已经完成除进程之外的所有Smalltalk成份的指称语义描述。作为系列文章的首篇,本文简要介绍Smalltalk的基本概念,并给出其完整的抽象文法,从而为准确地理解Smalltalk,正确地描述其形式语义奠定良好的基础。     

Toward a computational model of aspect and verb semantics

The authors examine aspect and the semantic classification of verbs, two areas of concern for natural language processing not often studied in the context of computational linguistics. A five-way aspectual classification system is defined on the basis of three aspectual features, making use of the concept of predicates as event structures. The aspectual value of a sentence can differ from that of its predicate due to the operation of aspectual functions. Sentential aspect is ultimately derived from the operation of various components of the sentence on the aspectual properties of the predicate. A system of twelve semantic features describing the core meaning of verbs provides a level of specificity that can distinguish different senses of verbs and could be used to predict their consequent syntactic and semantic behavior. The computational utility of these models will be tested on a working machine translation system.Also affiliated with Siemens Public Switching SystemsThis paper is written in conjunction with a research project funded by the Texas Higher Education Coordinating Board Advanced Research Programs, Grant No. 1631. The paper is a collective effort of the five authors. Although individual members of the group wrote particular portions, the entire group discussed and revised all parts of this work. We are jointly responsible for its contents. We wish to thank the journal's anonymous referees for their extremely helpful comments.     

同步语言Lustre的编译前端的设计与实现

同步语言Lustre所描述的反应系统通常应用在航空航天、国防建设等领域,对系统的正确性和安全性都要求很高。如果系统在运行时出现了正确性问题,很可能会导致系统崩溃,产生非常严重的后果。系统中的任何一个词法错误或者语法错误都应该受到重视,而且应该被及时纠正。因此,对Lustre语言进行正确的编译是十分重要的。传统的Lustre语言的编译器都采用OCaml语言描述,无法保证所有人员都能够很容易地理解和使用,而且,需要耗费开发人员大量的时间和精力。基于上述问题,提出了一种新型的Lustre语言编译器。新型的Lustre语言编译器前端主要采用C++语言进行描述,并对生成的抽象语法树的结构进行重新定义,简化了编译的过程。该编译前端会对一个经典的Lustre语言模型进行检测,通过对检测的结果进行分析,验证了该编译前端的可行性。     

LabVIEW与C语言的混合编程

LabVIEW是一种优秀的虚拟仪器系统开发平台,广泛应用于工控开发,而C语言是目前广泛使用的功能强大的编程语言。本文介绍了LabVIEW与C语言的混合编程方法,并给出了编程实例。