首页> 外文会议> >Universal domains in the theory of denotational semantics of programming languages
【24h】

Universal domains in the theory of denotational semantics of programming languages

机译:编程语言的指称语义理论中的通用域

获取原文

摘要

The authors present a categorical generalization of a well-known result in model theory, the Fraisse-Jonsson theorem, by which they characterize large classes of reasonable categories if they contain universal homogeneous objects. As a first application, they derive from this, for various categories of bifinite domains and with embedding-projection pairs as morphisms, the existence and uniqueness of universal homogeneous objects, and they deduce C.A. Gunter and A. Jung's result (see Logic in Computer Science, Comput. Sci. Press, p.309-19 (1988)) from this. Various categories of stable bifinite domains which apparently have not been considered in the literature before are introduced, and universal homogeneous objects for these categories (with stable embedding-projection pairs) are obtained. For four categories of even domains it is shown that although these categories contain universal objects they do not contain universal homogeneous objects. Finally, it is shown that all the constructions can be performed effectively.
机译:作者对模型理论中的一个著名结果Fraisse-Jonsson定理进行了分类概括,通过该定理,如果它们包含通用的齐次对象,它们便可以表征大类的合理类别。作为第一个应用,它们从中衍生出来,用于各种类别的双有限域,并且以嵌入投影对为形态,通用同构对象的存在和唯一性,并推论出C.A.。 Gunter和A. Jung的结果(参见Computer。Sci。Press计算机科学中的逻辑,第309-19页(1988))。介绍了在文献中显然没有考虑过的稳定双有限域的各种类别,并获得了这些类别的通用同构对象(具有稳定的嵌入-投影对)。对于偶数域的四个类别,表明尽管这些类别包含通用对象,但它们不包含通用同类对象。最后,显示了所有构造都可以有效地执行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号