QQ客服 官方微博 反馈留言

	Polymorphic type system with constraints
	Zheng, Hongjun ; Zhang, Naixiao
	1999
英文摘要	This paper concentrates on a polymorphic type system with constraints based on constrained types. By incorporating constraints into universal quantification, the system can make applications of parametrically polymorphic function more safe. The constrained types provide a new way for expressing and implementing overloading. The incorporating can improve the expressiveness of types. There are two layers with different type structures in the type system given. Introduction and elimination of constraints are in the different levels. It is proved that the satisfaction of constraints in W??, which is a type checking algorithm proposed , is decidable.; EI; 0; 4; 343-350; 22
语种	英语
出处	EI
出版者	jisuanji xuebaochinese journal of computers
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/302417]
专题	数学科学学院
推荐引用方式 GB/T 7714	Zheng, Hongjun,Zhang, Naixiao. Polymorphic type system with constraints. 1999-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。