Johan Håstad February 2013

First Page		Document Content
Date: 2013-02-27 07:36:02 Johan Håstad Gödel Prize Circuit complexity Silvio Micali ACM SIGACT International Colloquium on Automata Languages and Programming Theoretical computer science Applied mathematics Computer science		Johan Håstad February 2013 Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 192,98 KB Share Document on Facebook

	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
	The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation DocID: 1xTB5 - View Document
	Published in ASPLOS XIII: Proceedings of the Thirteenth International Conference on Architectural Support for Programming Languages and Operating Systems, March 2008 The Design and Implementation of Microdrivers Vinod Ga DocID: 1v5Xc - View Document