Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The downward closure of an indexed language -- the set of all (scattered) subwords of its members -- is well-known to be a regular over-approximation. It was shown by Zetzsche (ICALP 2015) that the downward closure of a given indexed language is effectively computable. However, the algorithm comes with no complexity bounds, and it has remained open whether a primitive-recursive construction exists. We settle this question and provide a triply (resp.\ quadruply) exponential construction of a non-deterministic (resp.\ deterministic) automaton. We also prove (asymptotically) matching lower bounds. For the upper bounds, we rely on recent advances in semigroup theory, which let us compute bounded-size summaries of words with respect to a finite semigroup. By replacing stacks with their summaries, we are able to transform an indexed grammar into a context-free one with the same downward closure, and then apply existing bounds for context-free grammars.
Grammar inference for complex programming languages remains a significant challenge, as existing approaches fail to scale to real world datasets within practical time constraints. In our experiments, none of the state-of-the-art tools, including Arvada, Treevada and Kedavra were able to infer grammars for complex languages such as C, C++, and Java within 48 hours. Arvada and Treevada perform grammar inference directly on full-length input examples, which proves inefficient for large files commonly found in such languages. While Kedavra introduces data decomposition to create shorter examples for grammar inference, its lexical analysis still relies on the original inputs. Additionally, its strict no-overgeneralization constraint limits the construction of complex grammars. To overcome these limitations, we propose Crucio, which builds a decomposition forest to extract short examples for lexical and grammar inference via a distributional matrix. Experimental results show that Crucio is the only method capable of successfully inferring grammars for complex programming languages (where the number of nonterminals is up to 23x greater than in prior benchmarks) within reasonable time limits. On the prior simple benchmark, Crucio achieves an average recall improvement of 1.37x and 1.19x over Treevada and Kedavra, respectively, and improves F1 scores by 1.21x and 1.13x.
Invective metaphors constitute a substantial portion of the metaphorical landscape within the Bulgarian language, and likely in other languages as well. This article endeavors to explore Bulgarian invective metaphors from various perspectives, including their vitality, expressiveness, conceptualization schemes, etc. To conduct this research, a questionnaire featuring 20 metaphors was administered to respondents. The collected data revealed two primary categories of metaphors: those with clearly discernible source images and those with obscure source images. Notably, the latter group appears to be transitioning towards historical metaphoricality. The paper proposes a hypothesis elucidating the reasons for that. Additionally, within the framework of the aforementioned aspects, efforts are made to systematize and delineate specific characteristics. Special attention is dedicated to examining Turkisms and insults prevalent not only among individuals, but also between distinct societal fractions, such as football fans.
Slavic languages. Baltic languages. Albanian languages
The need to restore lost data on the last major war of the Russian Empire implies a comprehensive coverage of events during those years, including their non-combat component. Based on the study of the “Journals of Military Actions” of combat units, which reflect little-researched stories of non-combat realities of front-line life, the authors offer a new perspective on the military everyday life of the Russian Imperial Army. The article focuses on the “pleasant” and unexpected nuances of the daily lives of soldiers and officers during the difficult years of war. Researchers have turned to such facts of military reality during the specified period as the organization of the award procedure for the command staff and lower ranks, the organization of prayers as integral components of festive events, the conduct of state (imperial) and religious holidays, as well as recreational activities. This work provides an opportunity to obtain an objective understanding of the multifaceted life and everyday life of people in wartime conditions: when circumstances allowed, performances, games, and sports events were organized and held. Without theoretical knowledge in the field of psychology and stress management techniques, the command of the Russian army organized and encouraged activities aimed at alleviating the negative consequences of combat stress.
Slavic languages. Baltic languages. Albanian languages
Compilers for accelerator design languages (ADLs) translate high-level languages into application-specific hardware. ADL compilers rely on a hardware control interface to compose hardware units. There are two choices: static control, which relies on cycle-level timing; or dynamic control, which uses explicit signalling to avoid depending on timing details. Static control is efficient but brittle; dynamic control incurs hardware costs to support compositional reasoning. Piezo is an ADL compiler that unifies static and dynamic control in a single intermediate language (IL). Its key insight is that the IL's static fragment is a refinement of its dynamic fragment: static code admits a subset of the run-time behaviors of the dynamic equivalent. Piezo can optimize code by combining facts from static and dynamic submodules, and it opportunistically converts code from dynamic to static control styles. We implement Piezo as an extension to an existing dynamic ADL compiler, Calyx. We use Piezo to implement an MLIR frontend, a systolic array generator, and a packet-scheduling hardware generator to demonstrate its optimizations and the static-dynamic interactions it enables.
В отличие от петербургского текста, генезис и структура, язык и авторы которого хорошо изучены и теоретически обоснованы благодаря трудам Тартуско-московской школы и фундаментальным исследованиям В. Н. Топорова, сараевский текст и его теоретическая основа все еще находятся в зачаточном состоянии. Несмотря на то, что о Сараеве как о городе, его архитектуре, истории, культуре, улицах и т. д. написано невероятное количество текстов, и на то, что он присутствует в том числе в устной традиции, cараевский текст как термин, который мог бы объединить тексты об этом городе в их семантической и семиотической связи, все еще не является общепринятым.
В статье речь пойдет о сараевском тексте и о поэзии А. Сидрана: три его центральных сборника (Sarajevska zbirka, Sarajevski tabut, Morija) описывают город как пространство истории, культуры, памяти и свидетельства. Опус Сидрана побудил исследователей осознать важность изучения генезиса и структуры сараевского текста, что указывает на необходимость определения этого термина в более широком смысле. Следовательно, поэтика города Сидрана для сараевского текста представляет собой то же, что и произведения Достоевского, по утверждению Топорова, представляют для петербургского.
Статья поступила в редакцию 10.01.2022.
Цитирование
Ибришимович-Шабич А., Баврка Е. «В Сараеве жить невозможно»: сараевский текст vs петербургский текст (на примере поэзии Абдулаха Сидрана) // Славянский альманах. 2022. No 1–2. С. 279–292. DOI: 10.31168/2073-5731.2022.1-2.3.05
History of Russia. Soviet Union. Former Soviet Republics, Slavic languages. Baltic languages. Albanian languages
Michel Steuwer, Thomas Koehler, Bastian Köpcke
et al.
The trend towards specialization of software and hardware - fuelled by the end of Moore's law and the still accelerating interest in domain-specific computing, such as machine learning - forces us to radically rethink our compiler designs. The era of a universal compiler framework built around a single one-size-fits-all intermediate representation (IR) is over. This realization has sparked the creation of the MLIR compiler framework that empowers compiler engineers to design and integrate IRs capturing specific abstractions. MLIR provides a generic framework for SSA-based IRs, but it doesn't help us to decide how we should design IRs that are easy to develop, to work with and to combine into working compilers. To address the challenge of IR design, we advocate for a language-oriented compiler design that understands IRs as formal programming languages and enforces their correct use via an accompanying type system. We argue that programming language techniques directly guide extensible IR designs and provide a formal framework to reason about transforming between multiple IRs. In this paper, we discuss the design of the Shine compiler that compiles the high-level functional pattern-based data-parallel language RISE via a hybrid functional-imperative intermediate language to C, OpenCL, and OpenMP. We compare our work directly with the closely related pattern-based Lift IR and compiler. We demonstrate that our language-oriented compiler design results in a more robust and predictable compiler that is extensible at various abstraction levels. Our experimental evaluation shows that this compiler design is able to generate high-performance GPU code.
Although the notion of qualified names is popular in module systems, it causes severe complications. In this paper, we propose an alternative to qualified names. The key idea is to import the declarations in other modules to the current module before they are used. In this way, all the declarations can be accessed locally. However, this approach is not efficient in memory usage. Our contribution is the {\it module weakening} scheme which allows us to import the minimal parts. As an example of this approach, we propose a module system for functional languages.
The novelty of the work is in the fact that for the first time in I. A. Goncharov’s works study, the peculiarities of the poetics of the title in the works of I. A. Goncharov of small and medium genre epic forms, are examined. The relevance of the article is due to the fact that the study of the title, the identification of its typological models will allow to describe the patterns in the artistic system of I. A. Goncharov. A classification of the titles of the writer’s works written in non-novel genre forms is proposed. The classification is based on the dominant structural and semantic features of the titles of the writer’s non-novel fictional prose. The question of the semantics of titles is raised in the article, the attention is paid to their linguistic features. Some questions of the functional interaction of the title with the main text are considered. It is noted that the analysis of various types of titles in the works of I. A. Goncharov showed the importance of this component in the poetics of the writer. The author of the article comes to the conclusion that the analysis of the title allows not only to consider the position of the “total” author, but also to explore many aspects of the writer's poetics: frame text, subject matter, composition, genre, style, narrative system, language.
Slavic languages. Baltic languages. Albanian languages
The aim of this paper is to draw attention to the potential didactic value of medical series in the context of patient-centred and biomedical approaches to medical practice, as well as to the way they are represented in language. We shall argue that these two paradigms dictate given modes of reasoning as to, for example, what health/ disease is and the patient-doctor role relationship. The biomedical model establishes disease as a malfunction of the body (which can be restored) and the patient as a passive recipient of treatment. By contrast, patient- centred medicine advocates a holistic approach to wellness by taking into consideration psychosocial aspects. Having these two models in mind and by adopting a social-constructivist approach to language, it is possible to analyse communication in a particular (pop)cultural text and examine the message from the perspective of mediated content about broadly understood health. The paper is organised as follows: it starts with a discussion of the evolution of medical TV series and a systematic review of studies dealing with their pedagogic role. Next it provides the analysis of two seasons of the Polish medical series Medics (Pol. Lekarze), giving special attention to the holistic presentation of the patient found in this multimodal media text.
Philology. Linguistics, Slavic languages. Baltic languages. Albanian languages
V prispevku <i>Med tipičnim in stereotipnim: družbena občutljivost pri pripravi ilustrativnega gradiva v eSSKJ</i> obravnavamo tipične kolokacije, ki so bile v leksikografskem procesu zaradi stereotipnosti ali politične nekorektnosti iz Slovarja slovenskega knjižnega jezika, tretja izdaja (eSSKJ) izločene, pri čemer so ostale ohranjene v slovarski bazi, ob izvozu slovarja za objavo na portalu Fran pa se ne izpišejo. Izpostavljamo štiri skupine tovrstnih tipičnih kolokacij: prve se pojavljajo pri leksemih, ki poimenujejo osebe, zlasti ranljive skupine, druge so kolokacije z zaznanimi nacionalnimi stereotipi, tretja skupina so nekorektne kolokacije pri leksemih, ki poimenujejo živali, in četrta nekorektne kolokacije pri žaljivi, vulgarni leksiki ipd. V prispevku tudi pojasnimo, zakaj se nekateri stereotipni elementi v slovar vseeno uvrščajo, ter opozorimo na pomen beleženja tovrstnih elementov, ki se je pokazal skozi proces dela, po začetnih redakcijah slovarja eSSKJ.
Slavic languages. Baltic languages. Albanian languages
The projected language of a general deterministic automaton with $n$ states is recognizable by a deterministic automaton with $2^{n-1} + 2^{n-m} - 1$ states, where $m$ denotes the number of states incident to unobservable non-loop transitions, and this bound is best possible. Here, we derive the tight bound $2^{n - \lceil \frac{m}{2} \rceil} - 1$ for permutation automata. For a state-partition automaton with $n$ states (also called automata with the observer property) the projected language is recognizable with $n$ states. Up to now, these, and finite languages projected onto unary languages, were the only classes of automata known to possess this property. We show that this is also true for commutative automata and we find commutative automata that are not state-partition automata.
There are tools to ease the 2D/3D graphics development for programmers. Sometimes, these are not directly accessible for all users requiring commercial licenses or based on trials, or long learning periods before to use them. In the modern world, the time to release final programs is crucial for the company successfully, also for saving money. Then, if programmers can handle tools to minimize the development time using well-known programming languages, they can deliver final programs on time, with minimum effort. This concept is the goal of this paper, offering a tool to create 3D renders over a familiarize programming language to speed up the web development time process. We present an extension of an interpreted programming language with an easy syntax to display 3D graphics on the web generating a template in a well-known web programming language, which can be customized and extended. Our proposal is based on Lua programming language as the input language for programmers, offering a web editor which interprets its syntax and exporting templates in WebGL over Javascript, also getting immediate output in a web browser. Tests show the effectiveness of our approach focus on the written code lines, also getting the expected output using a few computational resources.
Jan Baumeister, Bernd Finkbeiner, Matthis Kruse
et al.
Runtime monitors that are specified in a stream-based monitoring language tend to be easier to understand, maintain, and reuse than those written in a standard programming language. Because of their formal semantics, such specification languages are also a natural choice for safety-critical applications. Unlike for standard programming languages, there is, however, so far very little support for automatic code optimization. In this paper, we present the first collection of code transformations for the stream-based monitoring language RTLola. We show that classic compiler optimizations, such as Sparse Conditional Constant Propagation and Common Subexpression Elimination, can be adapted to monitoring specifications. We also develop new transformations -- Pacing Type Refinement and Filter Refinement -- which exploit the specific modular structure of RTLola as well as the implementation freedom afforded by a declarative specification language. We demonstrate the significant impact of the code transformations on benchmarks from the monitoring of unmanned aircraft systems (UAS).
The Transeurasian languages are among the most fervently debated language families in modern linguistics, their data contributing extensively to our current understanding of how genealogical and areal linguistics can complement each other as twin faces of diachronic linguistics. The term “Transeurasian” refers to a large group of geographically adjacent languages, stretching from the Pacific in the East to the Baltic, the Black Sea, and the Mediterranean in the West, that includes up to five uncontroversial linguistic families: Japonic, Koreanic, Tungusic, Mongolic, and Turkic. It is distinguished from the more traditional term “Altaic,” which we here reserve for the linguistic grouping consisting of Tungusic, Mongolic, and Turkic languages only. Figure 1 displays the distribution of the Transeurasian languages....
of vernacular western narrative sources for these relationships is broadly similar to the Old Rus ́ terminology, while the Latin narrative texts have a different set of terms. Students of Slavic languages may find her distinction between Old Slavic and Old Rus ́ to be excessively sharp, but the observation certainly deserves further examination. In addition to the problems of language and terminology, Mikhailova also tries to work out the relations of princes/lords and their “vassals,” their armed retainers and lesser lords. Here she seems on firm ground, as the differences in words cover realities that are remarkably similar in the west and in Rus ́ in the instances that she adduces. The same is true for relations among princes. Since most of the “lords” in Rus ́ had princely titles, the lesser princes functioned more like western “vassals” than like equals. Of course this phenomenon was in large part due to the absence of primogeniture in the Rus ́ principalities. In the west the oldest son usually was the only one to inherit a title, whereas in Rus ́ all the children of a prince inherited a princely title. Clearly some of them would not remain at the pinnacle of the princely hierarchy of power. The author’s argument is clear if occasionally repetitive, but the need to argue the case makes the text rather dense. Mikhailova tries to give examples that are as vivid as possible, but the pages of discussion make for slow going. Most of these examples come from the twelfth century, in spite of the title. The author’s focus is actually on the years after the death of Iaroslav in 1054, but mainly on the years after the 1130s. These years provide the best examples for her thesis, but the result is to leave the origins of the system she describes rather vague. Mikhailova’s account of her predecessor historians is brief and concentrates on western scholars. The reader needs to remember that Russian medievalists first looked for Russian uniqueness, in contrast to the western Middle Ages. N. P. PavlovSil ́vanskii and A. E. Presniakov instead looked for parallels and she sees the former as a pioneer. To be fair, the Marxist-universalist scheme of human development, including “feudalism,” also required similarities to the medieval west. The notion of political “disintegration” (razdroblennost ́) that she decries came when Soviet historians compared Rus ́ with the textbook Middle Ages of the early twentieth century, then seen as the story of the formation of centralized (“national”) states. Rus ,́ in this scheme, was just backward. Mikhailova is not the first to look for parallels in the west, but she tries to escape from these dilemmas by concentrating on specific structures and political values in her sources, and has found many similarities. Hers is an innovative and potentially productive approach that may very well be successful with further research and discussion.