Parallel Type-checking with Saturating LVars Peter Fogg Sam Tobin-Hochstadt Ryan R. Newton

First Page		Document Content
Date: 2015-02-28 14:55:06 Software engineering Computer programming Programming language theory Type theory Type systems Functional languages Programming paradigms Procedural programming languages Type inference HindleyMilner type system Monad Functional programming		Parallel Type-checking with Saturating LVars Peter Fogg Sam Tobin-Hochstadt Ryan R. Newton Add to Reading List Source URL: homes.sice.indiana.edu Download Document from Source Website File Size: 435,41 KB Share Document on Facebook

	Practical Optional Types for Clojure Ambrose Bonnaire-Sergeant† , Rowan Davies, Sam Tobin-Hochstadt† Indiana University†; Omnia Team, Commonwealth Bank of Australia {abonnair,samth}@indiana.edu, Rowan.Davies@cba. DocID: 1ru0R - View Document
	Project 5 - The Meta-Circular Evaluator DocID: 1rtvP - View Document
	02157 Functional Programming - Sequences DocID: 1rsIU - View Document
	A Type-Theoretic Interpretation of Standard ML Robert Harper and Christopher Stone frwh, School of Computer Science Carnegie Mellon University DocID: 1rrvD - View Document
	Some F# Practicalities Björn Lisper School of Innovation, Design, and Engineering Mälardalen University http://www.idt.mdh.se/˜blr/ DocID: 1rqrJ - View Document