Data types as initial algebras: A unification of Scottery and ADJery

A. Kanda
{"title":"Data types as initial algebras: A unification of Scottery and ADJery","authors":"A. Kanda","doi":"10.1109/SFCS.1978.12","DOIUrl":null,"url":null,"abstract":"This paper presents a formulation within the framework of data types as initial algebras, of parameterizations of data types. We will observe that Scott's data type constructors like +, ×, and circular definitions are parameterizations in our sense. Thence we will provide a uniform ground to compare ADJ-like data types with Lehmann-Smyth's data types, and will justify recent ADJ's claim that polynomial data types of Lehmann-Smyth could be simulated within ADJery.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1978.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper presents a formulation within the framework of data types as initial algebras, of parameterizations of data types. We will observe that Scott's data type constructors like +, ×, and circular definitions are parameterizations in our sense. Thence we will provide a uniform ground to compare ADJ-like data types with Lehmann-Smyth's data types, and will justify recent ADJ's claim that polynomial data types of Lehmann-Smyth could be simulated within ADJery.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
作为初始代数的数据类型:Scottery和ADJery的统一
本文在数据类型作为初始代数的框架内提出了数据类型参数化的一个公式。我们将注意到Scott的数据类型构造函数(如+、x和循环定义)在我们的意义上是参数化。因此,我们将提供一个统一的基础来比较类似于adjj的数据类型与Lehmann-Smyth的数据类型,并将证明最近的adjj声称可以在adjj中模拟Lehmann-Smyth的多项式数据类型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Should tables be sorted? On tape Bounded probabilistic turing machine transducers Model theoretic aspects of computational complexity Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations A data structure for orthogonal range queries
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1