找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Category Theory and Computer Science; Edinburgh, UK, Septe David H. Pitt,Axel Poigné,David E. Rydeheard Conference proceedings 1987 Springe

[复制链接]
楼主: Daguerreotype
发表于 2025-3-25 05:42:34 | 显示全部楼层
发表于 2025-3-25 11:33:29 | 显示全部楼层
A typed lambda calculus with categorical type constructors,f recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursive types and duals of iterators for lazy types. We will give reduction rules for this simply typed lambda calculus and show that they are strongly normalizing even though it has infinite things like infinite lists.
发表于 2025-3-25 13:32:49 | 显示全部楼层
Category Theory and Computer Science978-3-540-48006-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-25 18:19:21 | 显示全部楼层
发表于 2025-3-25 22:42:48 | 显示全部楼层
发表于 2025-3-26 03:53:14 | 显示全部楼层
https://doi.org/10.1007/978-3-319-28454-5n features: they are both able to model typed first-order logic, and in both structures one can build topoi. In this paper we compare the two structures and we show that, under some conditions, they give rise to equivalent topoi.
发表于 2025-3-26 06:58:34 | 显示全部楼层
发表于 2025-3-26 11:20:05 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222556.jpg
发表于 2025-3-26 13:33:58 | 显示全部楼层
发表于 2025-3-26 19:48:41 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 16:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表