函数／逻辑语言归约实现技术

ＲＦＵＮＬＯＧ是我们在ＬＮＦ演算基础上自行设计实现的一种函数／逻辑语言，它具有统一的操作语义。本文介绍ＲＦＵＮＬＯＧ语言的总体结构、归约操作语义及其解释实现技术。     

泛函程序设计语言实现中的图归约演算

本文叙述了在Ｖｏｎ Ｎｅｕｍａｎｎ机器上实现基于λ演算，ＳＫＩ演算的泛函程序设计语言所采用的图归约演算。ＳＫＩ－Ｇ演算是ＳＫＩ演算的图形表示，是基于图形的形式归约系统，面向机器实现，是实现高阶，引用透明，归约语义，全惰性泛函程序设计语言的主要技术基础。     

ELNF演算的解释技术

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

抽象算法C—T—ABS和ABSTRACT的理论推导与等价性证明

ＡＢＳＴＲＡＣＴ，Ｃ－Ｔ－ＡＢＳ是把λ表达式转换成ＳＫＩ表达式的抽象算法，是函数式语言实现的理论基础。本文从λ演算，ＳＫＩ演算的基本理论出发，对这两个算法进行了理论推导及功能的等价证明。展示了对一输入，Ｃ－Ｔ－ＡＢＳ能生成较优化的代码，并对它们生成代码的长度及归约效率进行了比较。     

半边图模型之聚合归约演算

提出了实现自组织多层次归约的一个指导原则,即自组聚合与归约的协调准则,其核心思想是,基于多聚合准则的自组聚合演算中的各个聚合子集是可以相交的,相交的部分是下一步归约演算的基础。给出了符合上述协调准则的自组图聚合归约演算模型,聚合子图是聚合演算的结果,在归约演算中,聚合子图对应为归约顶点,子图的子边界对应为归约半边,而由子图相交部分抽象出的子图边界之间的关系则对应为归约边,从而构成了形式上完整统一的自组织多层次归约。     

SQL中对not in和not exist查询的替代算法

ＳＱＬ（Ｓｔｒｕｃｔｕｒｅｄ Ｑｕｅｒｙ Ｌａｎｇｕａｇｅ）语言是一种介于关系代数和关系演算之间的结构化查询语言，它集数据查询（Ｄａｔａ Ｑｕｅｒｙ）、数据操纵（Ｄａｔａ Ｍａｎｉｐｕｌａｔｉｏｎ）、数据定义（Ｄａｔａ Ｄｅｆｉｎｉｔｉｏｎ）和数据控制（Ｄａｔ     

面向对象数据库的C宿主语言接口实现技术

面向对象的数据库管理系统（ＯＯＤＢＭＳ）通常都具备自身的查询语言，它以交互的方式供用户进行数据定义与数据操纵．除此之外，它还必须为程序员提供可在Ｃ、ＦＯＲＴＲＡＮ、ＰＡＳＣＡＬ等高级语言里嵌入使用查询语言的宿主语言接口．本文首先介绍这样一种Ｃ宿主语言接口Ｃ—ＯＳＤＬ，而后重点讨论它的实现技术，尤其是将Ｃ—ＯＳＤＬ命令转换成ＳＱＬ语句的翻译算法以及使用ＳＱＬ实现支持导航式查找的指针层次管理方法．文中讨论的Ｃ—ＯＳＤＬ实现技术以及最初的接口设计是面向对象的数据库技术的深入探讨．     

数据驱动的DFD及其编译

本文基于数据驱动机制，提出了一种描述数据流程图ＤＦＤ的中间语言并实现了对它的编译，提出了关系矩阵，行列向量表示法等，采用双缓冲，递归下降子程序等方法实现了各种必需的编译分析及目标代码的生成，是一种有效的辅助ＭＩＳ开发的工具。     

Sunrays微机FDDI光纤计算机网络系统

ＦＤＤＩ网络是一种广泛应用的高速计算机局域网络，本文分析了作者自行研制的Ｓｕｎｒａｙｓ微机ＦＤＤＩ光纤计算机网络系统的体系结构，设计和实现技术，其中详细讨论了网络适配器，网桥、集中器，设备驱动程序和Ｎｅｔｗａｒｅ接口软件的设计和实现技术。     

分布式文件系统BDDFS中多任务支撑环境的设计与实现

ＢＤＤＦＳ是一个基于ＮＯＶＥＬＬ网络系统环境，在无服务器的条件下实现的分布式文件系统。多任务管理是实现分布式文件系统的关键。本文介绍了一种在ＤＯＳ环境下利用线程实现多任务支撑环境的方法     

Comparing two functional programming systems

A technique is presented for comparing the performance of functional languages with different evaluation strategies running on different machines. A set of small benchmarks is used, and th execution times of these programs running in the functional language and in the implementation language of the functional system are compared. The ratio of these execution times measured how well the functional system used the resources of the underlying hardware and implementation language. Also two functional programming systems are described. One system is a graph reduction interpreter for lambda calculus. The other is a DEL-style intermediate instruction set architecture for FP. The benchmarks in FP and the performances of the two systems on these benchmarks are presented     

A static analysis of cryptographic processes: the denotational approach

This paper presents a non-uniform static analysis for detecting the term-substitution property in infinite cryptographic processes specified by the language of the spi calculus. The analysis is fully compositional following the denotational approach throughout. This renders the implementation of the analysis straightforward in functional programming. The results are then used to detect certain security breaches, like information leakage and authenticity breaches. As an example of its applicability, we apply the analysis to the SPLICE/AS protocol and the FTP server.     

On the calculus of positively constructed formulas for automated theorem proving

The paper deals with an expressive logic language LF and its calculus. Formulas of this language consist of some large-scale structural elements, such as type quantifiers. The language LF contains only two logic symbols—∀ and ∃, which form the set of logic connectives of the language. The logic calculus JF and complete strategy for automated proof search based on a single unary rule of inference are considered. This calculus has a number of other features which lead to the reduction of the combinatorial complexity of finding the deductions in comparison to the known systems for automated theorem proving as the Resolution method and Genzen calculus. Problems of effective implementation of JF as a program system for automated theorem proving are considered.     

基于重写方法的程序开发系统的设计和实现

本文介绍了一个基于重写方法的程序开发系统的设计和实现。该系统使用代数规范说明语言和扩展的函数式语言合成而形成的混合语言进行程序设计。系统将代数规范转换为合流的重写系统，并以平行最外方法辅以必要归约进行计算。该文详细介绍了系统的原理和实现技术，并以一些实例说明了系统的特点。     

The functional logic language BABEL and its implementation on a graph machine

The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functios. A sophisticated incompatibility check which is used to guarantee nonambiguity of BABEL programs is presented. For the implementation of the language, unification and backtracking are integrated in a programmed (functional) graph reduction machine. The implementation of this machine has been used for a comparison between Babel and PROLOG based on the runtimes of some example programs.     

传名调用演算的二值传递CPS变换

为Plotkin带常数传名调用λ演算定义了一个新的CPS(continuation-passing-style)变换方法.方法基于求值上下文变换,新颖之处在于,每次传递二值给继续而不是常规的一值.先给出二值CPS变换编码,再在此基础上定义CPS语言,最后建立源语言和CPS语言的一一映射关系并证明Plotkin的模拟定理.与Plotkin的工作比较,工作特点在于,给出了一个CPS归约闭语言,该语言中所有继续都可以用函数形式表达,且模拟定理的可靠性和完备性方向证明更为简单.     

A Safe Relational Calculus for Functional Logic Deductive Databases

In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on first-order logic and handles relation predicates, equalities and inequalities over partially defined terms, and approximation equations. For the calculus formulas, we have studied syntactic conditions in order to ensure the domain independence property. Finally, we have studied its equivalence w.r.t. the original query language, which is based on equality and inequality constraints.