The C++ Programming Language (3rd Edition) The C++ Programming Language (Special 3rd Edition) Flatterland: Like Flatland, Only More So The Logic of Scientific Discovery (Routledge Classics) A History of Mathematics The Cambridge Encyclopedia of the English Language Art in Theory 1900-2000: An Anthology of Changing Ideas Practical Statecharts in C/C++: Quantum Programming for Embedded Systems with CDROM C++ Design Patterns and Derivatives Pricing (Mathematics, Finance and Risk)

• Predicate Functors Next: 22. ...
• 6 Predefined OEChem Functors .
• There are many useful functors already defined in OEChem. These can be used by programmers with little or no understanding of the details of how functors work. ...
• The predefined functors in OEChem include: .
• OEAtomBase Functors OEHasAtomIdx(unsigned int) OEHasAtomName(const char *) OEHasMapIdx(unsigned int=0) OEHasAtomicNum(unsigned int) OEIsRGroup(unsigned int=0) OENthAtom(unsigned int, unsigned int) OEMatchFunc(const char*) OEAtomIsInRing OEIsChiralAtom OEHasStereoSpecified OEHasAlphaBetaUnsat OEAtomIsInResidue OEIsHydrogen OEIsHeavy OEIsPolar OEIsPolarHydrogen OEIsCarbon OEIsNitrogen OEIsOxygen OEIsHalogen OEIsSulfur OEIsPhosphorus OEIsAromaticAtom .
• Residue data Functors in OEAtomBases OEHasChainID(const char *) OEHasResidueNumber(unsigned int) OEHasFragmentNumber(unsigned int) .
• OEBondBase Functors OEHasBondIdx(unsigned int) OEHasOrder(unsigned int) OEBondIsInRing OEIsRotor OEIsChiralBond OEHasBondStereoSpecified OEIsAromaticBond template<class STLContainer>OEIsMember(const STLContainer &c) .
• OEConfBase Functors OEHasConfIdx(unsigned int) .
• Predicate Functors Next: 22. ...

• Geoffrey POWELL     On the structure of I \otimes F in the category of functors between F_2-vector spaces   (format. ...
• Résumé: The paper studies the structure of functors I\otimes F in the category of functors from finite dimensional F_2-vector spaces to all F_2-vector spaces, where F is a finite functor and I is the injective envelope of Lambda^1, the first exterior power functor. A detection theorem is proved for sub-functors of such functors, which is the basis of the proof that the functors I \otimes F are artinian of type one.

• Fibrations of Functors.
• The goal of the talk is to sketch a classification theory for fibrations of functors, and then to use the theory to explain why the maps in the Goodwillie tower for the identity functor represent principle fibrations. ...

• 2625 Clean Clean MicrosoftInternetExplorer4 Calculus of Homotopy Functors.
•           Calculus of homotopy functors was first developed by Thomas Goodwille in the late 80’s. It was an attempt to approximate a homotopy functor by the Taylor tower of universal n-excisive functors. Later in the mid 90’s, Brenda Johnson and Randy McCarthy introduced another approximation of  a homotopy functor by the Taylor tower of universal degree n functors and they proved that their tower is equivalent to Goodwillie’s tower under a mild condition.

• Motivic Functors .
• The notion of motivic functors refers to a motivic homotopy theoretic analog of continuous functors. In this paper we lay the foundations for a homotopical study of these functors. Of particular interest is a model structure suitable for studying motivic functors which preserve motivic weak equivalences and a model structure suitable for motivic stable homotopy theory. ... There is a symmetric monoidal smash product of motivic functors, and all model structures constructed are compatible with the smash product in the sense that we can do homotopical algebra on the various categories of modules and algebras. In particular, motivic cohomology is naturally described as a commutative ring in the category of motivic functors. ...
• Keywords and Phrases: Motivic homotopy theory, functors of motivic spaces, motivic cohomology, homotopy functors .

• Main Page   Groups   Namespaces   struct Functors.
• Collaboration diagram for struct Functors: .
• Functors are copyable types that define operator()(). ...
• If you want to mix functors from a different library with libsigc++ and these functors define result_type simply use this macro inside namespace sigc like so: namespace sigc { SIGC_FUNCTORS_HAVE_RESULT_TYPE }. ...
• If you want to mix functors from a different library with libsigc++ and these functors don't define result_type use this macro inside namespace sigc to expose the return type of the functors like so: namespace sigc { SIGC_FUNCTOR_TRAIT(first_functor_type, return_type_of_first_functor_type) SIGC_FUNCTOR_TRAIT(second_functor_type, return_type_of_second_functor_type). ...
• Functors are copyable types that define operator()(). ...
• Types that define operator()() overloads with different return types are referred to as multi-type functors. Multi-type functors are only partly supported in libsigc++.
• Closures are functors that store all information needed to invoke a callback from operator()().
• Adaptors are functors that alter the signature of a functor's operator()().
• libsigc++ defines numerous functors, closures and adaptors. Since libsigc++ is a callback libaray, most functors are also closures. The documentation doesn't distinguish between functors and closures.
• Value:template <> \ struct functor_trait<T_functor,false> \ { \ typedef T_return result_type; \ typedef T_functor functor_type; \ }; If you want to mix functors from a different library with libsigc++ and these functors don't define result_type use this macro inside namespace sigc to expose the return type of the functors like so: namespace sigc { SIGC_FUNCTOR_TRAIT(first_functor_type, return_type_of_first_functor_type) SIGC_FUNCTOR_TRAIT(second_functor_type, return_type_of_second_functor_type). ...
• Value:template <class T_functor> \ struct functor_trait<T_functor,false> \ { \ typedef typename T_functor::result_type result_type; \ typedef T_functor functor_type; \ }; If you want to mix functors from a different library with libsigc++ and these functors define result_type simply use this macro inside namespace sigc like so: namespace sigc { SIGC_FUNCTORS_HAVE_RESULT_TYPE }. ...

• The functors from category of connected topological spaces to groups by George Scaria (Jan 4, 2005) .
• Re: The functors from category of connected topological spaces to groups by Henno Brandsma (Jan 4, 2005) .
• Re: Re: The functors from category of connected topological spaces to groups by George Scaria (Jan 4, 2005) .
• Re: Re: Re: The functors from category of connected topological spaces to groups by Henno Brandsma (Jan 4, 2005) .
• From: George Scaria Date: Jan 4, 2005 Subject: Re: Re: The functors from category of connected topological spaces to groups .
• I feel that the examples you have given do not qualify as forgetful functors. ...
• In reply to "Re: The functors from category of connected topological spaces to groups", posted by Henno Brandsma on Jan 4, 2005:.
• >In reply to "The functors from category of connected topological spaces to groups", posted by George Scaria on Jan 4, 2005:.
• >>Does the functors from category of connected topological spaces to groups, i mean the functors of the homotopy and homology groups, qualify as forgetfun functors?.

• of Polynomial Functors.
• We will discuss the structure and properties of polynomial functors (such as the k-th symmetric or exterior power functors) in a characteristic-free setting. ...

• On Functors Expressible in the Polymorphic Typed Lambda Calculus.
• Abstract: Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, there will be functors from K to K whose action on objects can be expressed by type expressions and whose action on morphisms can be expressed by ordinary expressions. ...

• Predicate Functors .
• 3 Functors have State .
• 6 Predefined OEChem Functors .
• 7 Using your own Functors in OEChem .
• 8 Composition Functors in OEChem .
• 9 Predicates as a subset of Functors .

• Date Prev Date Next Thread Prev Thread Next Date Index Thread Index Boost-users Re: Functors and function_traits<>.
• Subject: Boost-users Re: Functors and function_traits<> .
• Is that right? >> >> That's because function object types (what you're >> calling functors) > > It's not me, AFAIK. ...
• Re: Boost-users Re: Functors and function_traits<> .
• Boost-users Re: Functors and function_traits<> .
• Boost-users Re: Functors and function_traits<> .
• Re: Boost-users Re: Functors and function_traits<> .
• Prev by Date: Re: Boost-users Re: Functors and function_traits<> .
• Next by Date: Boost-users Re: Functors and function_traits<> .
• Previous by thread: Re: Boost-users Re: Functors and function_traits<> .
• Next by thread: Boost-users Re: Functors and function_traits<> .

• Brenda Johnson - Constructing and characterizing degree n functors .
• Constructing and characterizing degree n functors.
• This construction arose from the study of Goodwillie's Taylor tower in the case of functors of modules over a ring. Using this model, we will characterize homologically degree n functors in terms of modules over a certain DGA, and discuss some related constructions and examples due to Eilenberg-Mac Lane, and Dold-Puppe. ...

Do you have a great site about Functors? Is your Functors site listed here? Would you like a prefered placement of your site in this directory?

It's easy! First place, the HTML from the box below on your page that you would like listed in this directory.

Then use our link submission request with your name, your contact information, and the URL of your site that has a link to this directory. After we verify your link to us, we'll make sure your site stays in our directory, and we'll give it prefered placement here also.

Here is how to make a simple text link to us. Just copy the code in this box to your website:

We can also develop a custom Guide To The Internet for your site. Please request your own custom Guide To The Internet.