Hasil untuk "Slavic languages. Baltic languages. Albanian languages"

Mark Koch, Agustín Borgna, Craig Roy et al.

Linear types enforce no-cloning and no-deleting theorems in functional quantum programming. However, in imperative quantum programming, they have not gained widespread adoption. This work aims to develop a quantum type system that combines ergonomic linear typing with imperative semantics and maintains safety guarantees. All ideas presented here have been implemented in Quantinuum's Guppy programming language.

Kord Eickmeyer, Georg Schindling

We study the notion of sparseness for regular languages over finite trees and infinite words. A language of trees is called sparse if the relative number of $n$-node trees in the language tends to zero, and a language of infinite words is called sparse if it has measure zero in the Bernoulli probability space. We show that sparseness is decidable for regular tree languages and for regular languages of infinite words. For trees, we provide characterisations in terms of forbidden subtrees and tree automata, leading to a linear time decision procedure. For infinite words, we present a characterisation via infix completeness and give a novel proof of decidability. Moreover, in the non-sparse case, our algorithm computes a measurable subset of accepted words that can serve as counterexamples in almost-sure model checking. Our findings have applications to automata based model checking in formal verifications and XML schemas, among others.

Fengmin Zhu, Andreas Zeller

Programmers regularly use strings to encode many types of data, such as Unix file paths, URLs, and email addresses, that are conceptually different. However, existing mainstream programming languages use a unified string type to represent them all. As a result, their type systems will keep quiet when a function requiring an email address is instead fed an HTML text, which may cause unexceptional failures or vulnerabilities. To let the type system distinguish such conceptually different string types, in this paper, we propose to regard \emph{formal languages as types} (FLAT), thereby restricting the set of valid strings by context-free grammars and semantic constraints if needed. To this end, email addresses and HTML text are treated as different types. We realize this idea in Python as a testing framework FLAT-PY. It contains user annotations, all directly attached to the user's code, to (1) define such \emph{language types}, (2) specify pre-/post-conditions serving as \emph{semantic oracles} or contracts for functions, and (3) fuzz functions via random string inputs generated from a \emph{language-based fuzzer}. From these annotations, FLAY-PY \emph{automatically} checks type correctness at runtime via \emph{code instrumentation}, and reports any detected type error as soon as possible, preventing bugs from flowing deeply into other parts of the code. Case studies on real Python code fragments show that FLAT-PY is enable to catch logical bugs from random inputs, requiring a reasonable amount of user annotations.

Eva Trivunović, Alenka Jelovšek

V prispevku je predstavljena (dis)kontinuiteta frazeološkega gradiva, ki so ga v slovenski knjižni jezik v 16. stoletju uvajali protestantski pisci s prevajanjem nebiblijskih besedil. Analiza različnih slovarskih in besedilnih virov je pokazala, da se večina teh frazemov v slovenskem knjižnem jeziku naslednjih obdobij ni ohranila. Tudi ob pojavljanju podobnih frazemov tako v slovarskih kot v besedilnih virih je pogosto bolj verjetno, da je prihajalo do prepisovanja iz starejših virov ali vsakokratnih ponovnih prevodov istih izvorno nemških in redkeje latinskih frazemov, kot da so bili frazemi dejansko živi v rabi.

Борис Сергеевич Новосельцев

Используя в основном сербские архивные материалы, Л. Димич вписывает историю югославской внешней политики в более широкий контекст международных отношений периода холодной войны, политики сверхдержав, возникновения и развития Движения неприсоединения и обсуждения вопроса безопасности в Европе. Книга рассказывает о том, как достигался серьезный дипломатический и международно-политический успех небольшой страны, которую не защищали пакты или гарантии сверхдержав. Рецензия поступила в редакцию 10.01.2024. Цитирование Новосельцев Б. С. Новая монография Любодрага Димича // Славянский альманах. 2024. No 1–2. С. 472–478. DOI: 10.31168/2073-5731.2024.1-2.24

Maliheh Izadi, Jonathan Katzy, Tim van Dam et al.

Transformer-based language models for automatic code completion have shown great promise so far, yet the evaluation of these models rarely uses real data. This study provides both quantitative and qualitative assessments of three public code language models when completing real-world code. We first developed an open-source IDE extension, Code4Me, for the online evaluation of the models. We collected real auto-completion usage data for over a year from more than 1200 users, resulting in over 600K valid completions. These models were then evaluated using six standard metrics across twelve programming languages. Next, we conducted a qualitative study of 1690 real-world completion requests to identify the reasons behind the poor model performance. A comparative analysis of the models' performance in online and offline settings was also performed, using benchmark synthetic datasets and two masking strategies. Our findings suggest that while developers utilize code completion across various languages, the best results are achieved for mainstream languages such as Python and Java. InCoder outperformed the other models across all programming languages, highlighting the significance of training data and objectives. Our study also revealed that offline evaluations do not accurately reflect real-world scenarios. Upon qualitative analysis of the model's predictions, we found that 66.3% of failures were due to the models' limitations, 24.4% occurred due to inappropriate model usage in a development context, and 9.3% were valid requests that developers overwrote. Given these findings, we propose several strategies to overcome the current limitations. These include refining training objectives, improving resilience to typographical errors, adopting hybrid approaches, and enhancing implementations and usability.

Bartosz Sawicki, Michał Śmiałek, Bartłomiej Skowron

This article explores the evolving role of programming languages in the context of artificial intelligence. It highlights the need for programming languages to ensure human understanding while eliminating unnecessary implementation details and suggests that future programs should be designed to recognize and actively support user interests. The vision includes a three-level process: using natural language for requirements, translating it into a precise system definition language, and finally optimizing the code for performance. The concept of an "Ultimate Programming Language" is introduced, emphasizing its role in maintaining human control over machines. Trust, reliability, and benevolence are identified as key elements that will enhance cooperation between humans and AI systems.

Jean-Baptiste Godon

Guillaume Martres

The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is not enough to declare a particular subset of the language as sound. While a few examples of Scala snippets have been manually translated into DOT, no systematic compilation scheme has been presented so far. In this thesis we develop a series of calculi of increasing complexity to model Scala and present a type-preserving compilation scheme from each of these calculus into DOT. Along the way, we develop some necessary extensions to DOT.

Shreekanth M Prabhu, Abhisek Midya

The study of spoken languages comprises phonology, morphology, and grammar. The languages can be classified as root languages, inflectional languages, and stem languages. In addition, languages continually change over time and space by picking isoglosses, as speakers move from region to/through region. All these factors lead to the formation of vocabulary, which has commonality/similarity across languages as well as distinct and subtle differences among them. Comparison of vocabularies across languages and detailed analysis has led to the hypothesis of language families. In particular, in the view of Western linguists, Vedic Sanskrit is a daughter language, part of the Indo-Iranian branch of the Indo-European Language family, and Dravidian Languages belong to an entirely different family. These and such conclusions are reexamined in this paper. Based on our study and analysis, we propose an Ecosystem Model for Linguistic Development with Sanskrit at the core, in place of the widely accepted family tree model. To that end, we leverage the Paninian system of sounds to construct a phonetic map. Then we represent words across languages as state transitions on the phonetic map and construct corresponding Morphological Finite Automata (MFA) that accept groups of words. Regardless of whether the contribution of this paper is significant or minor, it is an important step in challenging policy-driven research that has plagued this field.

Martin Klöker

ABSTRACT From the sixteenth century onwards, those education institutions that were humanistic by rhetoric turned to a basic education in poetry, teaching the use of verse in everyday life. Initially, this was related to ancient verse and its meaning, then was transferred to Neo-Latin poetry and to German (vernacular) verse, thereby transforming literary culture. On this basis, the role of poetry in literary culture in the Baltics is shown using three examples: the late humanistic literary culture of Riga in the 1580s, mainly in Latin; the literary culture in Reval (Tallinn) around fifty years later, much more influenced by German-language poetry; and finally, German poems in love letters of that time, showing the application and function of verse in the private space.

Denis Labouret

Among the French novelists of the 20th century, André Malraux and Romain Gary stand out for their practice and thought of adventure, at a time when individual adventure seems to be condemned by collective history. On this point, their works show clear convergences. Each of them, in fact, testified in his work to a life of “active adventurer”. Each of them built a work in which adventure, as a spring of action or as a theme of reflection, occupies a major place. La Voie royale and Les Conquérants, Les Racines du ciel and La Promesse de l’aube bear the mark of these convergences between two authors who are known to have frequented and appreciated each other. Moreover, according to both of them, the adventurer is in search of metamorphosis because he suffers from being locked up in the prison of identity. He seeks in adventure an experience of otherness which alone allows him to exist fully, by changing his “skin”. In this respect, much of Gary’s work seems to illustrate Malraux’s definition of the adventurer in the preface to Le Démon de l’absolu. But while Malraux moves away from the novelistic genre and turns, from 1945 onwards, to a reflection on art that gives adventure and metamorphosis an essentially aesthetic meaning, Gary does not cease to confer on adventure a profoundly existential meaning and goes so far as to situate it at the very heart of the creative process of the novel. This vision of adventure, which he develops in particular in his essay Pour Sganarelle, culminates in this ultimate adventure which will be accomplished, with the invention of Émile Ajar, in a totally new metamorphosis of the author. This discrepancy may provide an element of explanation for the differences that can be observed today between the reception of Malraux, who seems to be on the decline, and that of Gary, which is much more flourishing.

Marcial Gaißert, Manfred Kufleitner

We consider algorithms and lower bounds for various problems over forest languages; as input models we allow forest algebras, deterministic forest automata and nondeterministic forest automata. For the equivalence problem, we give an almost-linear-time algorithm for both forest algebras and deterministic forest automata; this is complemented by a polynomial time hardness result. The emptiness problem is complete for polynomial time over each of the three models. Additionally, we consider the emptiness of intersection problem for forest algebras and deterministic forest automata; this problem turns out to be complete for exponential time. It is well-known that the corresponding problems for word languages are complete for nondeterministic logarithmic space and for polynomial space, respectively. Equipped with this toolbox of algorithms and lower bounds, we consider various inclusion problems for regular forest languages under substitutions. The substitutions in this paper replace leaf variables by forest languages. Depending on the direction of the inclusion, the problem for a given substitution is either complete for polynomial time or for exponential time; in particular, the equivalence problem under substitutions is complete for exponential time and, hence, more difficult than the equivalence problem for forest languages without substitutions. If we ask whether there exists a substitution such that a given inclusion holds, then this problem is either complete for NP or exponential time, depending on whether we consider inclusion or equivalence; moreover, the problem is undecidable if the substitution is applied on both sides.

S. Borisov

The article provides an overview of a field study conducted among Czechs in Serbia, Romania, Bosnia and Herzegovina in 2019. The first results are presented, samples of transcribed texts are given. The purpose of the expedition was to collect narratives for the proper linguistic study of contact elements, conversations were conducted, among other things, about the history of the resettlement of Czechs to the Balkans, about folk culture, and interaction with other Slavic and non-Slavic ethnic groups. In the three regions studied, the Czech language remains unevenly due to a number of linguistic and extralinguistic factors. There are very few Czechs left in Bosnia and Herzegovina; Czech is the mother tongue only for elder people living in rural areas. In Serbia, there are several schools where Czech language and culture are taught, and in Romania there are schools where in the primary grades all subjects are taught in Czech. The collected language data is a valuable source for studying local Czech dialects and contact phenomena (borrowings, code-switching). The metalinguistic comments used by informants when they have difficulties in their Czech language during a conversation with a researcher are of particular interest to sociolinguistics.

Sergej S. Skorvid

The paper reports on a study of immigrant Czech and Polish dialects in Russia that have been strongly influenced by the dominant language of their surroundings. The author discusses problems detecting Russian lexical calques in the examined dialects, in particular differentiating calques and adapted borrowings. These difficulties appear to be due to the close affinity of the Russian language and the influenced dialects, which have common Slavic origin. The article proposes approaches for solving the problems by observing various aspects of calque formation, taking into consideration the fact that the border between the analyzed phenomena is vague and the calques are often firmly bounded with certain collocations. There are numerous transitional phenomena at the intersection of lexical calques and adapted borrowings, such as hybrid formations, formations in which the Russian affixal or root morphemes are transformed based on regular correspondences between idioms, cases of the formation of new lexical units in the recipient idiom according to the Russian model based on the semantics of correlated morphemes. In order to adequately describe such phenomena, it is proposed to introduce a more general concept of “collocative calques”.

Nikolay Bogomolov, Alexander Sobolev

For the first time all Alexander Alexeevich Kondratiev's letters to Valery Bryusov are published. A reflection of relationships between two poets, they are far more valuable, representing a very rich material on the history of Russian modernism in general. Persons and literary events mentioned are provided with extensive comments which incorporate these documents into the cultural context of the epoch. Considering the absenсe of response letters (which are presumably lost with the rest of Kondratiev's papers), these letters are of paramount importance for the reconstruction of Bryusov's biography.

Eraldo Pereira Marinho

The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to output a monochromatic result, beyond the trivial case z = 0 for constant indicator functions. To illustrate examples of randomly balanced languages and some monochromatic cases, it was performed classical computational simulations of the Deutsch-Jozsa quantum algorithm for the specific cases of 4 and 6 qubits, respectively. The general case of the Deutsch-Jozsa decided languages are named balanced languages, and their outcomes from the simulation suggest that such languages are equivalent to the quantum superposition of the monochromatic cases.

Maksims Dimitrijevs, Abuzer Yakaryılmaz

We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any language, there is a constant-space weak-IPS (the non-members may not be rejected with high probability); and, (iii) for any language, there is a constant-space IPS with two provers where the verifier reads the input once. Additionally, we show that uncountably many binary (unary) languages can be verified in constant space and in linear (quadratic) expected time.

E. DeGiuli

Many complex generative systems use languages to create structured objects. We consider a model of random languages, defined by weighted context-free grammars. As the distribution of grammar weights broadens, a transition is found from a random phase, in which sentences are indistinguishable from noise, to an organized phase in which nontrivial information is carried. This marks the emergence of deep structure in the language, and can be understood by a competition between energy and entropy.

Игорь Кошкин, Татьяна Стойкова

...