Semantics of Programming Languages and Quantum Topology
Project/Area Number |
23500016
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | Kyoto University |
Principal Investigator |
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2011: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
Keywords | ソフトウェア / プログラム理論 / プログラム意味論 / トポロジー / 量子不変量 / ソフトウェア学 / 量子トポロジー |
Research Abstract |
Traced monoidal categories and ribbon categories have been commonly used in semantics of programming languages and quantum topology. However, no concrete example of relating these two areas were not known before. Through this research project, we have constructed such examples by applying ideas and techniques of quantum topology to the categories used in semantics. Specifically, in categories like Rel, we obtained ribbon Hopf algebras via quantum double construction, and derived ribbon categories with non-trivial braidings. On the other hand, we also discovered that such a construction cannot be done for categories of sequential games, in which no non-trivial Hopf algebra exists.
|
Report
(4 results)
Research Products
(14 results)