<--- Back to Details
First PageDocument Content
Category theory / Mathematics / Algebra / Functors / Natural transformation / Exact functor / Forgetful functor / Yoneda lemma / Equivalence of categories / Sheaf / Calculus of functors / Adjoint functors
Date: 2008-04-11 05:38:22
Category theory
Mathematics
Algebra
Functors
Natural transformation
Exact functor
Forgetful functor
Yoneda lemma
Equivalence of categories
Sheaf
Calculus of functors
Adjoint functors

GENERIC REPRESENTATIONS OF ORTHOGONAL GROUPS: PROJECTIVE FUNCTORS IN THE CATEGORY Fquad CHRISTINE VESPA Abstract. In this paper, we continue the study of the category of functors Fquad , associated to F2 -vector spaces e

Add to Reading List

Source URL: irma.math.unistra.fr

Download Document from Source Website

File Size: 387,17 KB

Share Document on Facebook

Similar Documents

arXiv:0903.0340v3 [quant-ph] 6 JunPhysics, Topology, Logic and Computation: A Rosetta Stone John C. Baez Department of Mathematics, University of California

arXiv:0903.0340v3 [quant-ph] 6 JunPhysics, Topology, Logic and Computation: A Rosetta Stone John C. Baez Department of Mathematics, University of California

DocID: 1r6vo - View Document

Evaluation strategies for monadic computations Tomas Petricek Computer Laboratory University of Cambridge United Kingdom

Evaluation strategies for monadic computations Tomas Petricek Computer Laboratory University of Cambridge United Kingdom

DocID: 1qiGx - View Document

Modular Reifiable Matching A List-of-Functors Approach to Two-Level Types Bruno C. d. S. Oliveira Shin-Cheng Mu

Modular Reifiable Matching A List-of-Functors Approach to Two-Level Types Bruno C. d. S. Oliveira Shin-Cheng Mu

DocID: 1oSEd - View Document

On Delineability of Varieties in CAD-Based Q E S. McCallum (Macquarie University) and C. W. Brown (US Naval Academy) A key notion in the algorithmic theory of CADs is delineability: roughly speaking, the real variety of

On Delineability of Varieties in CAD-Based Q E S. McCallum (Macquarie University) and C. W. Brown (US Naval Academy) A key notion in the algorithmic theory of CADs is delineability: roughly speaking, the real variety of

DocID: 1ova3 - View Document

A fully abstract semantics for a higher-order functional language with nondeterministic computation A LAN J EFFREY A BSTRACT. This paper is about the relationship between the theory of monadic types and the practice of c

A fully abstract semantics for a higher-order functional language with nondeterministic computation A LAN J EFFREY A BSTRACT. This paper is about the relationship between the theory of monadic types and the practice of c

DocID: 1jeOT - View Document