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)

• c++ > How to pass functors to non-template methods? .
• How to pass functors to non-template methods? Hi, How do I pass a functor (function object) to a method or a function that is not a template or connected to a template? Given: class Hello_Functor { public: void operator()(void) {cout << "Hello";}; }; class Goodbye_Functor { public: void operator()(void) {cout << "Goodbye";}; }; void Print_Announcement(/* What type is a generic functor? */ functor_variable) { functor_variable(); /* variable of functor type */ return; } My current understanding is that functors can only be passed to templated functions or templated member functions (methods): template <class Functor> void Execute_Functor(const Functor& functor_variable) { functor_variable(); return; } Or a subset can be passed by resembling a function pointer: void Execute_Function(const void (*function_pointer)(void)); { (*function_ptr)(); return; } So, how does one declare a function (or method) which can receive a functor? Also, are template methods supported by all compilers? -- Thomas Matthews .
• Re: How to pass functors to non-template methods? On 29 Jul 2002 09:51:34 -0700, thomas. ...

• Functors in Haskell.
• Contravariant functors.
• The functors described above are covariant functors, meaning they preserve the direction of arrows. ...
• Composing functors.
• Two (covariant) functors F: A → B and G: B → C can be composed to create a new functor GF: A → C. ...
• {-| The composition of functors f and g is FComp f g -} newtype FComp f g a = FC { unFC :: f (g a) } instance (Functor f, Functor g) => Functor (FComp f g) where fmap f = FC. ...
• Interestingly, the composition of two contravariant functors is a covariant functor: .
• Higher-arity functors.
• The functors from C to D also form a category, written C→D or DC, whose objects are functors and whose morphisms are natural transformations. ...
• In Haskell, functors of the form C → CC correspond to a type constructor f of kind * -> * -> * and a function of type (a -> b) -> NatTrans (f a) (f b). ...
• Trinary functors and beyond.
• Naturally, the functors from B to DC form another category, which we'll call B→C→D. ...
• In Haskell, functors of the form C → C→C→C can be represented by a type constructor f of kind * -> * -> * -> * and a function of type (a -> b) -> (f a c d -> f b c d): .
• These trinary functors form another category A→B→C→D, which leads to 4-ary functors, and so forth. ...

• Ralf Meyer - The Baum-Connes Conjecture Via Derived Functors.

•  Home : Program : Java/C/C++ : Reduce complexity and boost readability using STL functors and predicates .
• Reduce complexity and boost readability using STL functors and predicates.
• STL concepts include containers, ranges, algorithms, and functors. ...
• For the purposes of this article, I'll refer to classes that have an overloaded operator() taking one argument as unary functors, and to classes having an overloaded operator() taking two arguments as binary functors. ...
• Functors: Why and whenFunctors were developed because functions can't hold any meaningful state. ... However, it's trivial to do it using functors, as Listing B shows. This is the main advantage of functors: They have context (state). Here are factors to remember about functors:.
• You apply functors one at a time by applying operator() to each element in the range.
• You can use functors to do something for each element in a range (such as multiply each element by 5), compute something meaningful for a range (such as the average of all elements), or both.

•    functors/compose2. ...

• Schur functors and motives, by Carlo Mazza.

• 3 Using Functors.

• Functors.

• Calculus of Functors & Applications Zvi G Arone--> .
• The main goal of this project is to apply calculus of functors, especially the "orthogonal calculus" version developed by M. ... The general theory of calculus associates with such a functor a sequence of "derivatives", where the n-th derivative is a spectrum with an action of the orthogonal group O(n), and a "Taylor tower" - a sequence of approximations by polynomial functors. ...

• Higher-order functors with transparent signatures.
• ABSTRACT The programming language Standard ML provides first-order functors, i. ... First-order functors in the language have a simple and elegant static semantics. ... modules parameterized by functors, is well understood. But it is only in the recent past that we have seen an implementation of higher-order functors with a formally defined static semantics in a dialect of Standard ML, SML/NJ. A study of this static semantics shows it to be much more complicated than the static semantics of first-order functors. This paper investigates whether we can trade some semantic features in the module language to obtain a simpler static semantics, closer in spirit to that of first-order functors. ...
• MacQueen , Mads Tofte, A Semantics for Higher-Order Functors, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p. ...
• Xavier Leroy, Applicative functors and fully transparent higher-order modules, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p. ...

• A chain rule in the calculus of homotopy functors.
• We formulate and prove a chain rule for the derivative, in the sense of Goodwillie, of compositions of weak homotopy functors from simplicial sets to simplicial sets. ... The derivative spectrum d(E o F)(X)$ of a composite of such functors is then stably equivalent to the balanced smash product of the derivatives dE(Y) and dF(X), with respect to the two actions of the loop group of Y. ...
• 7 T G Goodwillie, Calculus II: Analytic functors, K â “Theory 5 (1991/1992) 295â “332 .
• 11 M Lydakis, Simplicial functors and stable homotopy theory, Bielefeld preprint 98â “049 (1998) .

• Functors can be thought of as Quick Facts about: morphism.
• Functors were first considered in Quick Facts about: algebraic topology.
• Nowadays, functors are used throughout modern mathematics to relate various categories.
• That is, functors must preserve identity morphisms and composition of morphism.
• There are many constructions in mathematics which would be functors but for the fact that they "turn morphisms around" and "reverse composition". ...
• Note that contravariant functors reverse the direction of composition.
• Ordinary functors are also called covariant functors in order to distinguish them from contravariant ones. ...
• Contravariant functors are also occasionally called cofunctors.
• Doing these constructions pointwise gives covariant and contravariant functors from the category of pointed differentiable manifolds to the category of real vector spaces.
• Forgetful functors: The functor U : Grp → Set which maps a Quick Facts about: group.
• Functors like these, which "forget" some structure, are termed Quick Facts about: forgetful functor.
• Quick Summary not found for this subjectforgetful functors. ...
• Free functors: Going in the opposite direction of forgetful functors are free functors. ...
• Representable functors: We can generalize the previous example to any category C. ...
• Functors like these are called Quick Facts about: representable functor.
• Quick Summary not found for this subjectrepresentable functors. ...

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.