Polymorphic Functions with Set-Theoretic Types Part 1: Syntax, Semantics, and Evaluation

被引：18

作者：

Castagna, Giuseppe ^{[1
]}

Nguyen, Kim ^{[2
]}

Xu, Zhiwu ^{[1
,3
]}

Im, Hyeonseung ^{[2
]}

Lenglet, Serguei ^{[4
]}

Padovani, Luca ^{[5
]}

机构：

[1] Univ Paris Diderot, Sorbonne Paris Cite, CNRS, PPS, Paris, France

[2] Univ Paris Sud, LRI, Orsay, France

[3] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China

[4] Univ Lorraine, LORIA, Nancy, France

[5] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy

来源：

ACM SIGPLAN NOTICES | 2014年 / 49卷 / 01期

关键词：

Types; polymorphism; XML; intersection types; INTERSECTION; CALCULUS;

D O I：

10.1145/2535838.2535840

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This article is the first part of a two articles series about a calculus with higher-order polymorphic functions, recursive types with arrow and product type constructors and set-theoretic type connectives (union, intersection, and negation). In this first part we define and study the explicitly-typed version of the calculus in which type instantiation is driven by explicit instantiation annotations. In particular, we define an explicitly-typed.-calculus with intersection types and an efficient evaluation model for it. In the second part, presented in a companion paper, we define a local type inference system that allows the programmer to omit explicit instantiation annotations, and a type reconstruction system that allows the programmer to omit explicit type annotations. The work presented in the two articles provides the theoretical foundations and technical machinery needed to design and implement higher-order polymorphic functional languages for semi-structured data.

引用

页码：5 / 17

页数：13