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

	Synthesis of Differentiable Functional Programs for Lifelong Learning Lazar Valkov 1 Dipak Chaudhari 2 Akash Srivastava 1 Charles Sutton 1 Swarat Chaudhuri 2 1. Summary Differentiable programming languages (Paszke et al DocID: 1xVxf - View Document
	Programming Languages and Machine Learning Martin Vechev DeepCode.ai and ETH Zurich PL Research: Last 10 years (sample) • (Semi-) Automated Program Synthesis DocID: 1xUWv - View Document
	Teaching Programming Languages by Experimental and Adversarial Thinking∗ Justin Pombrio1 , Shriram Krishnamurthi2 , and Kathi Fisler3 1 2 DocID: 1xUDz - View Document
	tifact Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features Keywords Macros, hygiene, binding, scope 1. DocID: 1xUqQ - View Document
	Phrase-Based Statistical Translation of Programming Languages Svetoslav Karaivanov Veselin Raychev DocID: 1xUeI - View Document