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

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

高阶函数式语言到逻辑式语言的转移

本文给出高阶函数式语言Ｐｒｏｌｏｇ语言的一种转换技术，其中主要用到抽象闭包分析，Ｌａｍｂｄａ提升，顺序化以及Ｐｒｏｌｏｇ中的Ｃａｌｌ技术，本文的研究征顺于高阶性的处理上。     

一种基于ADT的函数语言及其操作语义模型

本文介绍一以ＡＤＴ为主要构件的函数语言，它是作者设计的函数式及面向对象式合成语言的函数部分，进而描述了其操作语义模型：多态λ演算十代数重写系统＝多态λ重写系统，并讨论该模型的Ｃｈｕｒｃｈ－Ｒｏｓｓｅｒ性质和强范式性质。     

纯函数式I/O的操作语义

目前被人们广泛采用的处理函数式Ｉ／Ｏ的机制有三种，ＭｏｎａｄＤｉａｌｏｇｕｅ，ＣＰＳ，本文采用ＣＣＳ的理论和方法，把互模拟等价作为Ｉ／Ｏ程序的相等关系，描述了这三种Ｉ／Ｏ机制的操作语义，推导出这三种Ｉ／Ｏ机制相互之间的转换关系，从而证明了这三种Ｉ／Ｏ机制在语义上是等价的。     

对象式逻辑程序设计

本文首先对逻辑程序设计与对象式程序设计进行一些比较，然后介绍对象式逻辑程序设计的基本原理、新进展、应用及目前存在的主要问题。     

合成语言FOPL基于方程逻辑的语义

程序设计语言ＦＯＰＬ是一种同时支持函数式程序设计风洛和面向对象程序设计风格的合成语言．本义介绍了ＦＯＰＬ的类型思想，并讨论了表达式纯洁性判断规则、表达式附类型规则及表达式等价判断规则，这些规则描述了ＦＯＰＬ基于方程逻辑的语义．     

一个兼备函数和逻辑风格的知识程序设计环境的设计

本文介绍了一个兼备函数和逻辑程序设计风格的知识程序设计环境,包括其设计思想、基本原理、结合方式及实现等,同时也讨论了设计过程中的一些考虑和选择。     

对象式逻辑语言LKO的实现技术

本文首先介绍对象逻辑程序设计语言ＬＫＯ的基本概念，然后讨论其转换系统的系统结构，主要数据结构及关键算法。     

A Rewriting Logic Approach to Operational Semantics (Extended Abstract)

This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step structural operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, and continuation-based semantics. Each of these language definitional styles can be faithfully captured as an RLS theory, in the sense that there is a one-to-one correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or pre-impose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles.     

The Rewriting Logic Semantics Project

Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory's axioms include both equations and rewrite rules provides a very useful “abstraction knob” to find the right balance between abstraction and observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.     

Paraconsistent Declarative Semantics for Extended Logic Programs

We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure. The programs may also be prioritized, that is, their clauses may be arranged in a partial order that reflects preferences among the corresponding rules. This yields a robust framework for representing knowledge in logic programs with a considerable expressive power. The declarative semantics for such programs is particularly suitable for reasoning with uncertainty, in the sense that it pinpoints the incomplete and inconsistent parts of the data, and regards the remaining information as classically consistent. As such, this semantics allows to draw conclusions in a non-trivial way, even in cases that the logic programs under consideration are not consistent. Finally, we show that this formalism may be regarded as a simple and flexible process for belief revision.     

动态模糊逻辑程序设计语言的指称语义

文献[8]借鉴Dijkstra的监督命令程序结构,给出了动态模糊逻辑程序设计语言的基本框架结构.在此基础上,进一步扩充和完善,并根据指称语义的原理和方法,用结构归纳法给出动态模糊逻辑程序设计语言的指称语义,主要包括:动态模糊程序设计语言的语义域、语义函数及其指称语义.最后给出了一个动态模糊程序设计语言的例子以观察程序的运行过程.     

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.     

Tree Tuple Languages from the Logic Programming Point of View

We introduce inductive definitions over language expressions as a framework for specifying tree tuple languages. Inductive definitions and their subclasses correspond naturally to classes of logic programs, and operations on tree tuple languages correspond to the transformation of logic programs. We present an algorithm based on unfolding and definition introduction that is able to deal with several classes of tuple languages in a uniform way. Termination proofs for clause classes translate directly to closure properties of tuple languages, leading to new decidability and computability results for the latter.