Editing Functional Programs Without Breaking Them Edward Amsden Ryan Newton Jeremy Siek

First Page		Document Content
Date: 2015-03-04 15:20:42 Theoretical computer science Mathematical logic Mathematics Type theory Lambda calculus Logic in computer science Computability theory Models of computation Standard ML Simply typed lambda calculus Combinatory logic Term		Editing Functional Programs Without Breaking Them Edward Amsden Ryan Newton Jeremy Siek Add to Reading List Source URL: ifl2014.github.io Download Document from Source Website File Size: 222,96 KB Share Document on Facebook

	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–1472) HITCHIN TYPE MODULI STACKS IN AUTOMORPHIC REPRESENTATION THEORY Zhiwei Yun (恽之玮) DocID: 1xVTT - View Document
	An adequacy theorem for partial type theory j.w.w. Simon Huber G¨ oteborg, May 11, 2017 An adequacy theorem for partial type theory DocID: 1v8ox - View Document
	E6(6) Exceptional Field Theory: Applications to Type IIB Supergravity on AdS5 ×S5 Arnaud Baguet ´ Ecole Normale Sup´ DocID: 1v5Rr - View Document
	Univalent Type Theory Thierry Coquand Tutorial for the Logic Colloquium 2016, Leeds Univalent Type Theory DocID: 1uZ9e - View Document
	Collection Principles in Dependent Type Theory? Peter Aczel1 and Nicola Gambino2 1 Departments of Mathematics and Computer Science, University of Manchester, DocID: 1uXqs - View Document