基于Web的网络编程技术

１ 引言 网络编程技术一般都是采用脚本语言作为编程语言。脚本语言具有和传统的编程语言相似的语法结构和风格,只是为了方便网络应用程序的设计,对传统的编程语言（如Ｃ,ＶＣ,ＶＢ等）进行了简化。例如,脚本语言允许用户在使用变量之前不需要声明变量类型,变量类型直接由变量值决定,并且在使用过程中可以自由更改变量类型。脚本语言的另外一个显著特点就是可以结合ＨＴＭＬ语言共同使用。脚本语言与ＨＴＭＬ语言具有非常好的兼容性,使用者可以直接在脚本代码中加入ＨＴＭＬ标签,或者在ＨＴＭＬ标签中加入脚本代码从而更好地实现页…     

基于语言值有序对三元组的多类型数据标准化方法

为了标准化处理多类型数据,基于语言值二元组,提出语言值有序对三元组表示模型,研究语言值有序对三元组及其性质,给出语言值有序对三元组之间的相似度.讨论语言值有序对三元组加权平均算子,构造模糊集、直觉模糊集、犹豫模糊集、语言真值直觉模糊集与语言值有序对三元组的标准化转化模型.结合语言值有序对三元组之间的相似度,将模糊集、直觉模糊集、犹豫模糊集、语言真值直觉模糊集的转化模型应用于模式识别中.最后,通过医院智能分诊的实例说明文中方法的合理性和有效性.     

TypeScript：微软的JavaScript替代语言

TypeScript是一种由微软开发的自由编程语言，它是JavaScript的一个超集。与Javascnp讲目比，TypeScript的改进包括：加入类型声明和编译时类型检查，增加完整的类结构，令其更近似于传统的面向对象语言，加入接口、     

3／2片联合树算法在动态贝叶斯网精确推理中的应用

基于动态贝叶斯网络处理动态不确定性问题的过程中推理是非常重要的，而推理算法的优劣决定着推理的执行效率。该文提出一种较简单的3/2片联合树算法，在不需要限制消去顺序且只作一次扩展的条件下构造联合树，所以算法简单且具有较小的复杂度。     

模糊知识库的查询策略

本文定义了具有更一般意义的模糊知识库FKB的概念,基于推理树DT,提出了查询类型1和类型2的查询策略,其基本思想是首先构造推理树DT,然后按照查询类型进行求值。     

一种含共享变量维持声明的并行程序语言

现今的并行编程实践多采用锁来同步对共享资源的访问,编程难且易出错;新引入的原子区构造虽简化了编程,但支持其实现的软硬件技术尚不令人满意.本文就同步提出一种新的语言级抽象-共享变量维持声明,它允许程序员从局部于线程的观点声明当前线程对某共享变量s访问的维持需求,即声明当前线程在运行时从上次访问s到这次访问s期间不允许其他线程访问s.从而,程序员无须考虑该如何使用锁等具体机制来同步对共享变量的访问,也可以避免或解决原子区所面临的一些问题.本文给出了共享变量维持声明的语法和语义描述,讨论了由这种声明信息生成共享变量访问控制代码的方法.     

类型化面向对象逻辑语言LKO的元级解释

本文介绍类型化面向对象逻辑语言ＬＫＯ的元级解释技术，主要包括对象约束、状态、方法的继承算法，以及子句解释、类型推理和检查的多种合一算法。     

ESMES专家系统

ESMES是一个设计和建造专家模型的程序系统,是一个灵活通用的系统。系统允许用者自由地实验他们的推理规则的类型,以及由EXPERT、EMYCIN、INTERNIST-1和PROSPECTOR方法导出的不定性权,以便用者找出对他们的具体问题更为合适的推理规则表示方案,给出较好的结果。本文介绍系统的结构、专家知识的构造和推理与控制策略等。     

1 1/2片联合树算法在动态贝叶斯网精确推理中的应用

基于动态贝叶斯网络处理动态不确定性问题的过程中推理是非常重要的,而推理算法的优劣决定着推理的执行效率。该文提出一种较简单的112片联合树算法,在不需要限制消去顺序且只作一次扩展的条件下构造联合树,所以算法简单且具有较小的复杂度。     

C语言DSP电机控制功能模块的特点及应用

C语言DSP电机控制功能模块由一结构体类型来组织,内含输入变量,历史变量、参数变量、输出变量、功能函数的指针变量。通过声明结构体类型、定义结构体变量,赋予结构体变量初值,调用其功能函数来实现其模块功能。通过用DSP控制两个电机C语言程序的开发可看出,用功能函数共享和移植的方法,可充分利用现有现成或成熟的软件资源,快速、高效、可靠地开发新的程序、模块和软件。     

A pragmatic type concept for Prolog supporting polymorphism, subtyping, and meta-programming

Approaches to typing logic programs often exclude various features of Standard Prolog. The system “Typical for annotated Prolog” (TaP) is a pragmatic approach to type checking programs written in Prolog without restricting the scope of the language. TaP checks Prolog programs that are extended with type declarations that support parametric polymorphism and subtyping. The purpose of this paper is to present an approach that extends Typical by meta-types for handling Prolog meta-programming techniques.     

行为规范作为类型

在面向对象程序设计中，继承性是导致语义复杂性的因素之一．本文讨论了作为代码共享机制的继承和表示功能特殊化的子类型的共存及相互关系．采用了将行为规范视为类型的概念，即类型为命名操作的集合．并在此基础上给出了类型、类及子类型关系的形式描述．     

Second Order Bounded Quantification with If-Expression

The full combination of if-expression and subtyping was known as a challenging problem for a long time. The difficulty comes from the fact that two branches of an if-expression might have different types and these types might not have a unique least upper bound. Such situation could happen in real object oriented languages such as Java. In our previous work, we investigated this problem in a simply typed lambda calculus extended with subtyping and if-expression and solved the type checking problem in that system. In this paper, we extend the result to bounded quantification combined with if-expression.     

Transitivity in coercive subtyping

Coercive subtyping is a general approach to abbreviation and subtyping in dependent type theories with inductive types. Coherence and admissibility of transitivity are important both for understanding of the framework and for its correct implementation. In this paper, we study the issue of transitivity in the context of subtyping for parameterised inductive types. In particular, we propose and study the notion of weak transitivity and show that, for a large class of parameterised inductive types, the natural subtyping rules are coherent and weak transitivity is admissible in an intensional type theory. A possible extension of type theory with certain extensional computation rules is also discussed for achieving admissibility of transitivity in general.     

Emerald: A general-purpose programming language

Emerald is a general-purpose language with aspects of traditional object-oriented languages, such as Smalltalk, and abstract data type languages, such as Modula-2 and Ada. It is strongly typed with a non-traditional object model and type system that emphasize abstract types, allow separation of typing and implementation, and provide the flexibility of polymorphism and subtyping with compile-time checking. This paper describes the Emerald language and its programming methodology. We give examples that demonstrate Emerald's features, and compare and contrast the Emerald approach to programming with the approaches used in other similar languages.     

A graph-based generic type system for object-oriented programs

We present a graph-basedmodel of a generic type system for an OO language. The type system supports the features of recursive types, generics and interfaces, which are commonly found in modern OO languages such as Java. In the classical graph theory, we define type graphs, instantiation graphs and conjunction graphs that naturally illustrate the relations among types, generics and interfaces within complex OO programs. The model employs a combination of nominal and anonymous nodes to represent respectively types that are identified by names and structures, and defines graph-based relations and operations on types including equivalence, subtyping, conjunction and instantiation. Algorithms based on the graph structures are designed for the implementation of the type system. We believe that this type system is important for the development of a graph-based logical foundation of a formal method for verification of and reasoning about OO programs.     

Polymorphic type-checking in scheme

This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a type system that is simple enough to be used by beginner students, yet is powerful enough to express the ideas of polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs some rudimentary syntax checking. The system uses subtyping, but only in a primitive fashion. It has a type datum which is a supertype of all types, and a type poof which is a subtype of all types. It uses intersection types to control the use of datum and to generate simple but accurate types.     

Kima: An Automated Error Correction System for Concurrent Logic Programs

We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties.Strong moding/typing and constraint-based analysis are turning out to play fundamental roles in debugging concurrent logic programs as well as in establishing the consistency of communication protocols and data types. Mode/type analysis of Moded Flat GHC is a constraint satisfaction problem with many simple mode/type constraints, and can be solved efficiently. We proposed a simple and efficient technique which, given a non-well-moded/typed program, diagnoses the reasons of inconsistency by finding minimal inconsistent subsets of mode/type constraints. Since each constraint keeps track of the symbol occurrence in the program, a minimal subset also tells possible sources of program errors.Kima realizes automated correction by replacing symbol occurrences around the possible sources and recalculating modes and types of the rewritten programs systematically. As long as bugs are near-misses, Kima proposes a rather small number of alternatives that include an intended program. Search space is kept small because the minimal subset confines possible sources of errors in advance. This paper presents the basic algorithm and various optimization techniques implemented in Kima, and then discusses its effectiveness based on quantitative experiments.     

No-Longer-Foreign: Teaching an ML compiler to speak C “natively”

We present a new foreign-function interface for SML/NJ. It is based on the idea of data-level interoperability—the ability of ML programs to inspect as well as manipulate C data structures directly.The core component of this work is an encoding of the almost² complete C type system in ML types. The encoding makes extensive use of a “folklore” typing trick, taking advantage of ML's polymorphism, its type constructors, its abstraction mechanisms, and even functors. A small low-level component which deals with C struct and union declarations as well as program linkage is hidden from the programmer's eye by a simple program-generator tool that translates C declarations to corresponding ML glue code.     

Privacy via Subsumption

We describe an object calculus allowing object extension and structural subtyping. Each object has a “dictionary” to mediate the connection between names and components. This extra indirection yields the first object calculus combining both object extension and full width subtyping in a type-safe manner. If class inheritance is modeled with object extension, private fields and methods can be achieved directly by scoping restrictions: private fields or methods are those hidden by subsumption. We prove that the type system is sound, discuss a variant allowing covariant self types, and give some examples of the expressiveness of the calculus.