| Structures Definable in Polymorphism |
| |
| 作者姓名： | Fu Yuxi |
| |
| 作者单位： | DepartmentofComputerScience,ShanghaiJiaoTongUniversity,Shanghai200030,P,R.China |
| |
| 摘 要： | Encodings in polymorphism with finite product types are considered.These encodings are given in terms of I-algebras.They have th property that the ground terms are precisely the closed normal terms of the encoded types.The proof of a well-known result is transplanted to the setting and it is shown why weak recursion is admissible.The paper also shows how to carry out the dual encodings using the existential quantifier.
|
| 关 键 词： | 多形计算机系统 编码 打印 I－代数学 |
Structures definable in polymorphism |
| |
| Fu Yuxi.Structures Definable in Polymorphism[J].Journal of Computer Science and Technology,1998,13(6):579-587. |
| |
| Authors: | Yuxi Fu |
| |
| Affiliation: | Department of Computer Science; Shanghai Jiao Tong University; Shanghai 200030; P.R. China; |
| |
| Abstract: | Encodings in polymorphism with finite product types are considered. These encodings aregiven in terms of I-algebras. They have the property that the ground terms are precisely theclosed normal terms of the encoded types. The proof of a well-known result is transplantedto the setting and it is shown why weak recursion is admissible. The paper also shows how tocarry out the dual encodingS using the existential quantifier. |
| |
| Keywords: | Polymorphic types type theory |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
