Invited Talk: The Sufficiently Smart Compiler can Prove Theorems! Joachim Breitner University of Pennsylvania Philadelphia, Pennsylvania, USA

First Page		Document Content
Date: 2017-09-09 06:01:35 Computer programming Software engineering Declarative programming Functional programming Functional languages Monad Haskell Proof assistant Mathematical proof		Invited Talk: The Sufficiently Smart Compiler can Prove Theorems! Joachim Breitner University of Pennsylvania Philadelphia, Pennsylvania, USA Add to Reading List Source URL: www.cs.ox.ac.uk Download Document from Source Website File Size: 43,92 KB Share Document on Facebook

	Functional Programming for Compiling and Decompiling Computer-Aided Design DocID: 1xW3j - View Document
	Informatics 1 Functional Programming Lectures 1 and 2 Monday 24–Tuesday 25 September 2012 Introduction, Functions Don Sannella DocID: 1xVWA - View Document
	Grattage, Jonathan JamesA functional quantum programming language. PhD thesis, University of Nottingham. Access from the University of Nottingham repository: http://eprints.nottingham.ac.ukthesis.pdf Cop DocID: 1xVW1 - View Document
	Functional Reactive Programming, Refactored Ivan Perez Manuel B¨arenz Henrik Nilsson DocID: 1xVxz - View Document
	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