Transparent Modules with Fully Syntactic Signatures Zhong Shao Dept. of Computer Science Yale University New Haven, CT[removed]removed]

First Page		Document Content
Date: 2000-03-14 14:04:54 Functors Standard ML Sheaf Natural transformation Limit Combinatorial species Map Grothendieck topology Yoneda lemma Category theory Abstract algebra Mathematics		Transparent Modules with Fully Syntactic Signatures Zhong Shao Dept. of Computer Science Yale University New Haven, CT[removed]removed] Add to Reading List Source URL: flint.cs.yale.edu Download Document from Source Website File Size: 149,96 KB Share Document on Facebook

	Modular Reifiable Matching A List-of-Functors Approach to Two-Level Types Bruno C. d. S. Oliveira Shin-Cheng Mu DocID: 1oSEd - View Document
	Sage Reference Manual: Discrete dynamics Release 6.7 The Sage Development Team DocID: 1gotx - View Document
	A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes? Alejandro S´anchez1 and C´esar S´anchez1,2 1 2 DocID: 1fXrE - View Document
	COMBINATORIAL SPECIES AND LABELLED STRUCTURES Brent Abraham Yorgey A DISSERTATION in Computer and Information Science DocID: 1eIxQ - View Document
	Sage: Open Source Mathematical Software: Symbolic Computation, Combinatorial Species, Backtracking Algorithms, and Distributed Computation William Stein, Gary Furnish, Mike Hansen, Robert Miller, and Yi Qiang March 21, 2 DocID: 1dL8V - View Document