set-theoretic foundation of parametric polymorphism and subtyping

ISCAS OpenIR

	set-theoretic foundation of parametric polymorphism and subtyping
	Castagna Giuseppe; Xu Zhiwu
	2011
会议名称	16th ACM SIGPLAN International Conference on Functional Programming, ICFP'11
会议录名称	Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP
页码	94-106
会议日期	September
会议地点	Tokyo, Japan
收录类别	EI ; SCI
ISSN	1523-2867
ISBN	9781450308656
部门归属	(1) CNRS Laboratoire Preuves Programmes et Systèmes Univ. Paris Diderot Sorbonne Paris Cité Paris France; (2) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Science Beijing China
摘要	We define and study parametric polymorphism for a type system with recursive, product, union, intersection, negation, and function types. We first recall why the definition of such a system was considered hard-when not impossible-and then present the main ideas at the basis of our solution. In particular, we introduce the notion of "convexity" on which our solution is built up and discuss its connections with parametricity as defined by Reynolds to whose study our work sheds new light. Copyright © 2011 ACM.; We define and study parametric polymorphism for a type system with recursive, product, union, intersection, negation, and function types. We first recall why the definition of such a system was considered hard-when not impossible-and then present the main ideas at the basis of our solution. In particular, we introduce the notion of "convexity" on which our solution is built up and discuss its connections with parametricity as defined by Reynolds to whose study our work sheds new light. Copyright © 2011 ACM.
关键词	Computer Programming Languages Recursive Functions
主办者	ACM SIGPLAN
学科领域	Computer Science
语种	英语
WOS记录号	WOS:000297632700010
引用统计	被引频次：7[WOS] [WOS记录] [WOS相关记录]
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16197
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Castagna Giuseppe,Xu Zhiwu. set-theoretic foundation of parametric polymorphism and subtyping[C],2011:94-106.