作为初始代数的数据类型:Scottery和ADJery的统一

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI:10.1109/SFCS.1978.12

A. Kanda

{"title":"作为初始代数的数据类型:Scottery和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":"{\"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}","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

摘要

本文在数据类型作为初始代数的框架内提出了数据类型参数化的一个公式。我们将注意到Scott的数据类型构造函数(如+、x和循环定义)在我们的意义上是参数化。因此，我们将提供一个统一的基础来比较类似于adjj的数据类型与Lehmann-Smyth的数据类型，并将证明最近的adjj声称可以在adjj中模拟Lehmann-Smyth的多项式数据类型。

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

查看原文本刊更多论文

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

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.

求助全文

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

来源期刊

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)

自引率

0.00%

发文量