Examples of using Functor in English and their translations into Korean
{-}
-
Colloquial
-
Ecclesiastic
-
Ecclesiastic
-
Programming
-
Computer
Picard functor.
Ext functor Functor category Representable functor.
Picard functor.
The functor Hom(-, B) is also called the functor of points of the object B.
Derived functor.
They introduced the terms functor and natural isomorphism and, in 1945, added the terms category and natural transformation.
Derived functor.
The point of the functor is to ensure that the same comparison function will always be used, even if the programmer makes a mistake.
Derived functor.
For example, we can define a functor that takes an int n and returns a collection of array operations that work exclusively on arrays of length n.
Adjoint functors.
Functors are probably one of the most complex features of OCaml, but you don't have to use them extensively to be a successful OCaml programmer.
Derived functors.
If we were not using this functor but the standard array type, the compiler would not be able to detect the error, and we would get a runtime error at some undetermined date in the future, which is much worse.
Derived functors.
Since both functors and function pointers can be invoked using the syntax of a function call, they are interchangeable as arguments to templates when the corresponding parameter only appears in function call contexts.
Derived functors.
Functors allow the behavior of the associated function to be parameterized(e.g. through arguments passed to the functor's constructor) and can be used to keep associated per-functor state information along with the function.
Adjoint functors.
Right derived functor.
Actually, you may never have to define a functor yourself, but you will surely encounter them in the standard library.
Right derived functor.
I would say that Rich Hickey's template functor callback approach is slightly better than C++11's lambda functions.
Right derived functor.
The three major logical systems which Lesniewski developed were: Protothetic,a theory of propositions and propositional functors, similar in power to a theory of propositional types, providing an extended propositional calculus with quantified functional variables;
Fully faithful functor.
I'll let Rich explain from hisarticle:"I must come clean at this point, and point out that the syntax above for makeFunctor() is possible only in the proposed language, because it requires template members(specifically, the Functor constructors would have to be templates).
Fully faithful functor.
Faithful functor.
Fully faithful functor.