Information Semantics and Relational Programming in Dedekind Categories

Dedekind范畴中的信息语义和关系编程

• 批准号: 15500013
• 负责人: KAWAHARA Yasuo
• 金额: $ 1.66万
• 依托单位: KYUSHU UNIVERSITY
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2003
• 资助国家: 日本
• 起止时间: 2003 至 2006
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-15500013/
• 关键词: binay relation; relational method; cardinality of relations; program semantics; matching of graphs; network flow; fuzzy relation; Dedekind inequality; ファジイ理論; ネットワークフロー; 関係代数; 関係計算; 関係型プログラミング; プログラミング理論; 基数; カテゴリー論; 形式概念; 関係集合論; ファジイ論理; binay relation; relational method; cardinality of relations; program semantics; matching of graphs; network flow; fuzzy relation; Dedekind inequality; ファジイ理論; ネットワークフロー; 関係代数; 関係計算; 関係型プログラミング; プログラミング理論; 基数; カテゴリー論; 形式概念; 関係集合論; ファジイ論理

The project studied on Information Semantics and Relational Programming in Dedekind categories and the relationalmethods in Computer Science for four years and the main results are the following :(1) The foundations of the cardinality of (binary) relations, including Dedekind inequality.(2) Another proof of Tarski's fixed point theorem in Dedekind categories,(3) Determination of the reversibility for classic automata with triplet local transition rules.(4) Verification of demonic composition and demonic orders between meanings of programs in Dedekind categories.By the aid of the fund the author could give lectures on the results by the study project, in particular, could serve a program committee of the International Conference on Relational Methods in Computer Science/Applications of Kleene Algebras. The author would like to express his sincere gratitude for all persons who support the scientific project.

The project studied on Information Semantics and Relational Programming in Dedekind categories and the relationalmethods in Computer Science for four years and the main results are the following :(1) The foundations of the cardinality of (binary) relations, including Dedekind inequality.(2) Another proof of Tarski's fixed point theorem in Dedekind categories,(3) Determination of the reversibility for classic automata with triplet local transition rules.(4)验证Dedekind类别中计划含义之间的恶魔组成和恶魔命令。借助基金的帮助，作者可以为研究项目的结果提供讲座，特别是为Kleene代数的计算机科学/应用计算机科学/应用程序中的国际关系方法会议提供了计划委员会。作者要对支持科学项目的所有人表示衷心的感谢。