ń* : Beyond Currying Jason Hemann

First Page		Document Content
Date: 2014-01-13 20:04:11 Lambda calculus Mathematics Currying Partial application Apply Arity Variadic function Combinatory logic Scheme Declarative programming Software engineering Functional programming		ń* : Beyond Currying Jason Hemann Add to Reading List Source URL: www.schemeworkshop.org Download Document from Source Website File Size: 176,90 KB Share Document on Facebook

	Currying (what Functions of Several Arguments Really are) More About Higher-Order Functions Remember simple? Björn Lisper DocID: 1pGXD - View Document
	ń* : Beyond Currying Jason Hemann DocID: 1pcfW - View Document
	simply typed λ-calculus logical verification week DocID: 1oJ8I - View Document
	Polynomial Time Inverse Computation for Accumulative Functions with Multiple Data Traversals Kazutaka Matsuda (Tohoku University) Kazuhiro Inaba (National Institute of Informatics*) Keisuke Nakano (the University of Elec DocID: 1kGUU - View Document
	Testing Polymorphic Properties Jean-Philippe Bernardy, Patrik Jansson, and Koen Claessen Chalmers University of Technology {bernardy,patrikj,koen}@chalmers.se Abstract. This paper is concerned with testing properties of DocID: 1jJcH - View Document