Termgraph Rewriting Maria Schett Supervisors: Martin Avanzini, Georg Moser November 8, 2011

First Page		Document Content
Date: 2016-12-11 09:15:55 Theoretical computer science Programming language theory Mathematics Formal languages Mathematical logic Logic in computer science Computability theory Rewriting Normal form Graph rewriting Pure Term		Termgraph Rewriting Maria Schett Supervisors: Martin Avanzini, Georg Moser November 8, 2011 Add to Reading List Source URL: www.maria-a-schett.net Download Document from Source Website File Size: 120,32 KB Share Document on Facebook

	An alternative approach to Freiman’s theorem in p-groups Matthew C. H. Tointon∗ Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, DocID: 1xVmO - View Document
	RJ 09:0 Counterpoint A UNITY proof with pure nondeterminism Rajeev Joshi DocID: 1xUH6 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Lecture 6, Thurs Feb 2: Mixed States So far we’ve only talked about pure states (i.e., isolated quantum systems), but you can also have quantum superposition layered together with regular, old probabilistic uncer DocID: 1xTZp - View Document
	HIGH DIMENSIONAL EXPANDERS ALEXANDER LUBOTZKY Abstract. Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence an DocID: 1xTsJ - View Document