Proving Type Class Laws for Haskell Andreas Arvidsson, Moa Johansson, and Robin Touche Department of Computer Science and Engineering, Chalmers University of Technology , moa.johansson@chalmers.

First Page		Document Content
Date: 2016-07-08 05:39:59 Algebraic structures Semigroup theory Functional programming Type theory Automated theorem proving Monoid Monad Type class Semiring IP Haskell Free monoid		Proving Type Class Laws for Haskell Andreas Arvidsson, Moa Johansson, and Robin Touche Department of Computer Science and Engineering, Chalmers University of Technology , moa.johansson@chalmers. Add to Reading List Source URL: www.cse.chalmers.se Download Document from Source Website File Size: 229,72 KB Share Document on Facebook

	AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION DocID: 1vah4 - View Document
	Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for DocID: 1sXwT - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson DocID: 1sOSK - View Document
	Microsoft Word - BlankPage DocID: 1rugC - View Document
	SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany DocID: 1rrok - View Document