A Coq Library For Internal Verification of Running-Times Jay McCarthy University of Massachusetts at Lowell Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler Northwestern University

First Page		Document Content
Date: 2018-10-23 12:14:23 Computer programming Software engineering Type theory Computing Functional programming Adjoint functors Monad HindleyMilner type system Variety Redblack tree List		A Coq Library For Internal Verification of Running-Times Jay McCarthy University of Massachusetts at Lowell Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler Northwestern University Add to Reading List Source URL: jeapostrophe.github.io Download Document from Source Website File Size: 313,84 KB Share Document on Facebook

	TREE STRUCTURES FOR REGION REPRESENTATION Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742 DocID: 1rrxI - View Document
	´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1 DocID: 1r7j1 - View Document
	Novel tree edit operations for RNA secondary structure comparison Julien Allali1 and Marie-France Sagot2 1 Institut Gaspard-Monge, Universit´e de Marne-la-Vall´ee, Cit´e Descartes, Champs-sur-Marne, 77454 DocID: 1qWYL - View Document
	INFERRING OPTIMAL SPECIES TREES UNDER GENE DUPLICATION AND LOSS M. S. BAYZID, S. MIRARAB and T. WARNOW∗ Department of Computer Science, The University of Texas at Austin, Austin, Texas 78712, USA DocID: 1qJXj - View Document
	Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees DocID: 1qsSy - View Document