多项式函子的线性范畴(扩展部分)

IF 0.6 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Logical Methods in Computer Science Pub Date : 2014-03-04 DOI:10.2168/LMCS-10(2:2)2014

P. Hyvernat

{"title":"多项式函子的线性范畴(扩展部分)","authors":"P. Hyvernat","doi":"10.2168/LMCS-10(2:2)2014","DOIUrl":null,"url":null,"abstract":"We construct a symmetric monoidal closed category of polynomial endofunctors\n(as objects) and simulation cells (as morphisms). This structure is defined\nusing universal properties without reference to representing polynomial\ndiagrams and is reminiscent of Day's convolution on presheaves. We then make\nthis category into a model for intuitionistic linear logic by defining an\nadditive and exponential structure.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2014-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Linear Category of Polynomial Functors (extensional part)\",\"authors\":\"P. Hyvernat\",\"doi\":\"10.2168/LMCS-10(2:2)2014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct a symmetric monoidal closed category of polynomial endofunctors\\n(as objects) and simulation cells (as morphisms). This structure is defined\\nusing universal properties without reference to representing polynomial\\ndiagrams and is reminiscent of Day's convolution on presheaves. We then make\\nthis category into a model for intuitionistic linear logic by defining an\\nadditive and exponential structure.\",\"PeriodicalId\":49904,\"journal\":{\"name\":\"Logical Methods in Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2014-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logical Methods in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.2168/LMCS-10(2:2)2014\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logical Methods in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2168/LMCS-10(2:2)2014","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 5

摘要

我们构造了多项式内函子(作为对象)和模拟细胞(作为态射)的对称单轴闭范畴。这种结构是使用通用属性来定义的，而不涉及表示多项式图，这让人想起了戴在预轴上的卷积。然后，我们通过定义一个加性和指数结构，将这个范畴变成一个直观线性逻辑的模型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Linear Category of Polynomial Functors (extensional part)

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is reminiscent of Day's convolution on presheaves. We then make this category into a model for intuitionistic linear logic by defining an additive and exponential structure.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Logical Methods in Computer Science 工程技术-计算机：理论方法

CiteScore

1.80

自引率

0.00%

发文量

105

审稿时长

6-12 weeks

期刊介绍： Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author. Topics of Logical Methods in Computer Science: Algebraic methods Automata and logic Automated deduction Categorical models and logic Coalgebraic methods Computability and Logic Computer-aided verification Concurrency theory Constraint programming Cyber-physical systems Database theory Defeasible reasoning Domain theory Emerging topics: Computational systems in biology Emerging topics: Quantum computation and logic Finite model theory Formalized mathematics Functional programming and lambda calculus Inductive logic and learning Interactive proof checking Logic and algorithms Logic and complexity Logic and games Logic and probability Logic for knowledge representation Logic programming Logics of programs Modal and temporal logics Program analysis and type checking Program development and specification Proof complexity Real time and hybrid systems Reasoning about actions and planning Satisfiability Security Semantics of programming languages Term rewriting and equational logic Type theory and constructive mathematics.

期刊最新文献

Node Replication: Theory And Practice A categorical characterization of relative entropy on standard Borel spaces The Power-Set Construction for Tree Algebras Token Games and History-Deterministic Quantitative-Automata A coherent differential PCF