The Theory behind TheoryMine Alan Bundy School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, Edinburgh, Scotland. Lucas Dixon

First Page		Document Content
Date: 2010-07-11 12:18:50 Computability theory Mathematics Mathematical logic Theoretical computer science Recursion Theory of computation Primitive recursive function Recursive data type Mutual recursion Automated theorem proving Theorem Presentation of a group		The Theory behind TheoryMine Alan Bundy School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, Edinburgh, Scotland. Lucas Dixon Add to Reading List Source URL: dream.inf.ed.ac.uk Download Document from Source Website File Size: 242,36 KB Share Document on Facebook

	PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT Advisor: Armando Solar-Lezama DocID: 1rduU - View Document
	XQTC: A Static Type-Checker for XQuery Using Backward Type Inference Pierre Genevès Nabil Layaïda DocID: 1qUUF - View Document
	XQuery and Static Typing: Tackling the Problem of Backward Axes Pierre Genevès Nils Gesbert DocID: 1qIWp - View Document
	Programovací jazyky F# a OCaml Chapter 4. Generic and recursive types Generic types DocID: 1qxwI - View Document
	Polymorphic types Polymorphism, Recursive Data Types, and Trees Consider the good old length function: Björn Lisper DocID: 1qf4a - View Document