Неконтролируемая эмпатия – творчество на грани невроза

В статье исследуются психологические аспекты журналистской профессии, в частности механизма эмпатии как одного из главных условий профессионализма. Неконтролируемая журналистом эмпатия может привести к негативным психологически последствиям, вплоть до неврозов. Представителям СМИ для сохранения оптимального психологического состояния необходимо соблюдать правила психологической гигиены. Целесообразен вопрос о создании в редакциях и телерадиокомпаниях постоянных служб психологического консультирования.У статті досліджено психологічні аспекти професії журналіста, зокрема механізму емпатії як однієї з головних умов професіоналізму. Емпатія, яка не є підконтрольною журналісту, може призвести до негативних психологічних наслідків, до неврозів. Представникам ЗМІ треба дотримуватись правил психологічної гігієни для збереження оптимального психологічного стану. Питання про створення в редакціях і телерадіокомпаніях постійних служб психологічного консультування також є актуальним.The author researches psychological aspects of journalism, in particular, empathy as one of the professional characteristics. Uncontrollable empathy is the way to negative psychological consequences for journalist, such as neuroses, depressions, emotional exhaustion. It is very important for journalists, especially reporters, to have psychological knowledges, to keep the rules of psychological hygiene to prevent that

Constructing applicative functors

Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications. This paper sets out to explore the space of non-monadic applicative functors useful in programming. We work with a generalization, lax monoidal functors, and consider several methods of constructing useful functors of this type, just as transformers are used to construct computational monads. For example, coends, familiar to functional programmers as existential types, yield a range of useful applicative functors, including left Kan extensions. Other constructions are final fixed points, a limited sum construction, and a generalization of the semi-direct product of monoids. Implementations in Haskell are included where possible

A Visual {DSL} for the certification of open source software

Quality assessment of open source software is becoming an important and active research area. One of the reasons for this recent interest is the consequence of Internet popularity. Nowadays, programming also involves looking for the large set of open source libraries and tools that may be reused when developing our software applications. In order to reuse such open source software artifacts, programmers not only need the guarantee that the reused artifact is certified, but also that independently developed artifacts can be easily combined into a coherent piece of software. In this paper we improve over previous works and describe a visual language that allows programmers to graphically describe how software artifacts can be combined into powerful software certification processes. This paper introduces the visual language and describes how its elements are available to the user through an intuitive interface.(undefined

Combinator Parsers: From Toys to Tools

AbstractWe develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed “analyze themselves”. Our new combinators may be used for the construction of large parsers to be used in compilers in practical use