Keyword and Optional Arguments in PLT Scheme Matthew Flatt Eli Barzilay University of Utah and PLT

First Page		Document Content
Date: 2009-07-29 15:35:55 Software engineering Computer programming Computing Programming languages Object-oriented programming languages Functional programming Procedural programming languages Subroutines Scheme Parameter Lisp Anonymous function		Keyword and Optional Arguments in PLT Scheme Matthew Flatt Eli Barzilay University of Utah and PLT Add to Reading List Source URL: www.cs.utah.edu Download Document from Source Website File Size: 176,16 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