Deciding Functional Lists with Sublist Sets

First Page		Document Content
Date: 2011-11-18 09:02:21 Higher-order functions Model theory Graph theory Mathematical induction Structural induction Fold Map List Interpretation Software engineering Mathematics Computing		Deciding Functional Lists with Sublist Sets Add to Reading List Source URL: lara.epfl.ch Download Document from Source Website File Size: 229,85 KB Share Document on Facebook

	Honors add-on, Homework #2 solution In the two-person game described for this homework, the players take turns taking rocks off one or both piles, but they must take at least one rock off and cannot take more than one ro DocID: 1qZEW - View Document
	Automating Inductive Proofs using Theory Exploration Koen Claessen, Moa Johansson, Dan Ros´en, and Nicholas Smallbone Department of Computer Science and Engineering, Chalmers University of Technology {koen,moa.johansson DocID: 1qo2r - View Document
	HipSpec: Automating Inductive Proofs of Program Properties Koen Claessen Moa Johansson Nicholas Smallbone DocID: 1q9N6 - View Document
	Electronic Communications of the EASST VolumeProceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS 2015) DocID: 1pwZI - View Document
	Hipster: Integrating Theory Exploration in a Proof Assistant Moa Johansson, Dan Ros´en, Nicholas Smallbone, and Koen Claessen Department of Computer Science and Engineering, Chalmers University of Technology {jomoa,danr DocID: 1pgaI - View Document