Proving Correctness via Free Theorems The Case of the destroy build-Rule Janis Voigtl¨ander Technische Universit¨ at Dresden - Colorado State Highway 64 - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-08-01 05:50:11 Software engineering Computer programming Declarative programming Higher-order functions Programming language comparisons Recursion Fold FO Haskell features Standard ML		Proving Correctness via Free Theorems The Case of the destroy/build-Rule Janis Voigtl¨ander Technische Universit¨ at Dresden Add to Reading List Source URL: www.janis-voigtlaender.eu Download Document from Source Website File Size: 122,81 KB Share Document on Facebook

	Proving Correctness via Free Theorems The Case of the destroy/build-Rule Janis Voigtl¨ander Technische Universit¨ at Dresden DocID: 1rlNb - View Document
	Designing and Implementing a Framework for BDI-style Communicating Agents in Haskell (Position Paper) Alessandro Solimando and Riccardo Traverso? Dipartimento di Informatica e Scienze dell’Informazione, Università di DocID: 1r08I - View Document
	CS240H: Implementing Paxos in Haskell Jiayuan Ma JuneAbstract DocID: 1qU9T - View Document
	A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev DocID: 1quWn - View Document
	Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu DocID: 1qtvY - View Document