A Representation of SFP

A Representation of SFP
复制标题

DOI:
10.1006/inco.1994.1031
复制
发表时间:
1994-04
期刊:
Inf. Comput.
影响因子:
--
通讯作者:
Guo-Qiang Zhang
Guo-Qiang Zhang
中科院分区:
其他
文献类型:
--
作者:
Guo-Qiang Zhang

文献摘要

被引文献

相似文献

本章介绍SFP域类别的表示。它使用的结构类似于但比斯科特的信息系统更通用。从根岑的结石中提取出来,产生了一种称为“结石结构”的基本结构。序列结构决定了信息系统公理的主要部分。一类称为强有限域的特殊的非线性结构与SFP域等价。构造像Plotkin权力域和功能空间,以及一个完整的偏序,这样的结构给递归定义的系统的解决方案。
This chapter introduces a representation of the category of SFP domains. It uses structures similar to but more general than Scott’s information systems. Distilled from Gentzen’s sequent calculi, a basic structure called a sequent structure is produced. Sequent structures determine a major part of the axioms of information systems. A category of special kind of sequent structures called the strongly finite ones is shown to be equivalent to the category of SFP domains. Constructions like the Plotkin power domain and the function space are given, as well as a complete partial order of such structures to give solutions to recursively defined systems.