Simple Unification-based Type Inference for GADTs Simon Peyton Jones Dimitrios Vytiniotis Stephanie Weirich Geoffrey Washburn

First Page		Document Content
Date: 2014-07-10 05:47:06 Software engineering Unification Type system Admissible rule Type inference Symbol Hindley–Milner Entailment Function Type theory Logic Mathematics		Simple Unification-based Type Inference for GADTs Simon Peyton Jones Dimitrios Vytiniotis Stephanie Weirich Geoffrey Washburn Add to Reading List Source URL: www.seas.upenn.edu Download Document from Source Website File Size: 215,50 KB Share Document on Facebook

	Functional Programming with Overloading and Higher-Order Polymorphism Mark P. Jones Department of Computer Science, University of Nottingham, University Park, Nottingham NG7 2RD, UK. Abstract. The Hindley/Milner type sys DocID: 1u86f - View Document
	From Hindley-Milner Types to First-Class Structures Mark P. Jones Department of Computer Science, University of Nottingham, University Park, Nottingham NG7 2RD, England. Abstract DocID: 1q0Mu - View Document
	Many Holes in Hindley-Milner Sam Lindley Laboratory for Foundations of Computer Science, University of Edinburgh DocID: 1pTkf - View Document
	Ambivalent Types for Principal Type Inference with GADTs APLAS 2013, Melbourne Jacques Garrigue & Didier R´ DocID: 1aSvZ - View Document
	Chapter 12 ASL: A Small Language We present in this chapter a simple language: ASL (A Small Language). This language is basically the λ-calculus (the purely functional kernel of Caml) enriched with a conditional constr DocID: 1aMfs - View Document