monads

  • 21Strong monad — In category theory, a strong monad over a monoidal category is a monad (T,η,μ) together with a natural transformation , called (tensorial) strength, such that the diagrams …

    Wikipedia

  • 22metaphysics — /met euh fiz iks/, n. (used with a sing. v.) 1. the branch of philosophy that treats of first principles, includes ontology and cosmology, and is intimately connected with epistemology. 2. philosophy, esp. in its more abstruse branches. 3. the… …

    Universalium

  • 23monad — monadic /meuh nad ik/, monadical, monadal, adj. monadically, adv. /mon ad, moh nad/, n. 1. Biol. a. any simple, single celled organism. b. any of various small, flagellate, colorless ameboids with one to three flagella, esp. of the genus Monas …

    Universalium

  • 24Leibniz, Gottfried Wilhelm von — (1646 1716)    by Brett Nicholls   Gottfried Wilhelm von Leibniz is drawn into Deleuze s engagement with the history of philosophy with a book length study, The Fold: Leibniz and the Baroque, and he is present at strategic moments in Deleuze s… …

    The Deleuze dictionary

  • 25Leibniz, Gottfried Wilhelm von — (1646 1716)    by Brett Nicholls   Gottfried Wilhelm von Leibniz is drawn into Deleuze s engagement with the history of philosophy with a book length study, The Fold: Leibniz and the Baroque, and he is present at strategic moments in Deleuze s… …

    The Deleuze dictionary

  • 26Adjoint functors — Adjunction redirects here. For the construction in field theory, see Adjunction (field theory). For the construction in topology, see Adjunction space. In mathematics, adjoint functors are pairs of functors which stand in a particular… …

    Wikipedia

  • 27Distributivity — In mathematics, and in particular in abstract algebra, distributivity is a property of binary operations that generalises the distributive law from elementary algebra.For example:: 2 • (1 + 3) = (2 • 1) + (2 • 3).In the left hand side of the… …

    Wikipedia

  • 28List comprehension — A list comprehension is a syntactic construct available in some programming languages for creating a list based on existing lists. It follows the form of the mathematical set builder notation (set comprehension) as distinct from the use of map… …

    Wikipedia

  • 29Arrows in functional programming — In computer science, arrows provide a more general interface to computation than monads. Monads essentially provide a sequential interface to computation: one can build a computation out of a value, or sequence two computations together. Arrows… …

    Wikipedia

  • 30Bilfinger, Georg Bernhard — ▪ German philosopher born Jan. 23, 1693, Cannstatt, Württemberg [now in Germany] died Feb. 18, 1750, Stuttgart       German philosopher, mathematician, statesman, and author of treatises in astronomy, physics, botany, and theology. He is best… …

    Universalium