Kamp Theorem for Pomset Languages of Higher Dimensional Automata
Emily Clement, Enzo Erlich, Jérémy Ledent
Temporal logics are a powerful tool to specify properties of computational systems. For concurrent programs, Higher Dimensional Automata (HDA) are a very expressive model of non-interleaving concurrency. HDA recognize languages of partially ordered multisets, or pomsets. Recent work has shown that Monadic Second Order (MSO) logic is as expressive as HDA for pomset languages. In the case of words, Kamp's theorem states that First Order (FO) logic is as expressive as Linear Temporal Logic (LTL). In this paper, we extend this result to pomsets. To do so, we first investigate the class of pomset languages that are definable in FO. As expected, this is a strict subclass of MSO-definable languages. Then, we define a Linear Temporal Logic for pomsets, and show that it is equivalent to FO.
“Look, it’s my first Wikipedia article!” The attitude of university students to an authentic process genre writing task
Riina Reinsalu
In the past ten years, in the context of higher education Wikipedia has started to be seen as a friend, not a foe. Hence a number of courses involve a variety of Wikipedia-based tasks. The aim of the present article is to assess the suitability of Wikipedia-based authentic writing tasks from the students’ perspective. The qualitative content analysis of students’ learning journals has indicated that the process of writing is well supported by dividing the task into separate stages and providing feedback at every stage. Nevertheless, the teaching process should also involve raising learners’ genre awareness as the knowledge that students get while reading Wikipedia might not be sufficient for writing an article that would meet all the genre requirements.
***
"“Vaata, mu esimene Vikipeedia artikkel!“ Üliõpilaste suhtumine autentsesse žanripõhisesse protsessikeskesse kirjutamisülesandesse"
Kuna Wikipedia on kasutussageduselt seitsmes veebisait maailmas ja üliõpilased puutuvad sellega tahes-tahtmata kokku, on viimase kümmekonna aasta jooksul jõutud arusaamiseni, et Wikipediasse tuleb suhtuda kui sõpra, mitte kui vaenlasse. Seetõttu on eri õppeainetesse ülikoolides lõimitud mitmesuguseid Wikipedia-põhiseid ülesandeid. Muu hulgas on Wikipedia artikli kirjutamist õpetatud (žanripõhise) protsessikeskse tekstiloome põhimõtetest lähtudes, kuid vähe on uuritud, kuidas üliõpilased sellesse ülesandesse suhtuvad. Üliõpilaste suhtumine on aga oluline, sest see on tihedalt seotud õpikogemuse tähenduslikkusega. Artikli eesmärk on hinnata Wikipedia artiklil põhineva autentse kirjutamisülesande sobivust üliõpilaste kirjaliku väljendusoskuse arendamisel, otsides vastust küsimusele, kuidas tulevad üliõpilased toime žanripõhise protsessikeskse tekstiloome etappidega ja millist õpikogemust žanripõhine kirjutamisülesanne üliõpilastele pakub.
Artiklis käsitletakse 2019. aasta sügissemestril Tartu Ülikooli väljendusõpetuse aines kasutatud ülesannet, mille raames pidid õigusteaduse üliõpilased koostama erialase eestikeelse Wikipedia artikli. Ülesanne koosnes seitsmest etapist: eeltööst, mustandist, kaasüliõpilaste tagasisidest, puhtandist, õppejõu/õppeassistendi tagasisidest, lõppvariandist ja selle tagasisidest. Artikli kirjutamise ajal (9 nädala vältel) pidasid üliõpilased vabatahtlikult õpipäevikuid, kuhu tegid vähemalt kümme sissekannet vabalt valitud teemal (kokku 40 õpipäevikut; u 75 lk). Andmed kodeeriti kvalitatiivse sisuanalüüsi põhimõtetest lähtudes nii deduktiivselt kui ka induktiivselt, kasutades tarkvara NVivo.
Nii nagu varasemates uurimustes, leidis ka praegusel juhul kinnitust, et Wikipedia artikli kirjutamine sobib kirjaliku eneseväljenduse aine õppeülesandeks. Selle käigus läbitakse samad uurimistöö protsessi etapid nagu näiteks referaadi kirjutamisel, aga kuna Wikipedia kaudu edastatakse teavet avalikkusele, mitte lihtsalt õppejõule, suurendab see vähemasti osa üliõpilaste huvi kirjutamise vastu (eeldusel et on õnnestunud valida huvipakkuv teema). Samas pööravad üli.pilased kirjutamise ajal lugejatele siiski võrdlemisi vähe tähelepanu: vaid need, kes lähtusid kasust laiemale auditooriumile juba teema valimisel, arvestasid lugejaga ülesande eri etappides, ülejäänute puhul ilmnes vajadus arvestada lugejaga peamiselt mustandijärgse tagasiside etapis. Lisaks peavad üli.pilased huvitavaks Wikipedia artiklit kui žanri, sest sellega ei olda kirjutajatena varem kokku puututud. See aga tähendab, et õppetöös ei piisa sellest, kui tutvustada artikli kvaliteedi kriteeriume ja vormistusnõudeid ning näidata häid artikleid. Žanriteadlikkuse suurendamiseks on vaja põhjalikult käsitleda ka artiklite struktuuri ja keelekasutust, et üliõpilastel tekiks selgem arusaam žanritavadest.
Philology. Linguistics, Finnic. Baltic-Finnic
Oqova Suv Terminlari
Dilobar Xurramova
Maqolada tarixiy hayotimizda oqindi suv va u bilan bog‘liq atamalarning ifodalanishi, struktur qo‘llanilishi xususida mulohazalar bildiriladi. Xalqimiz tarixiga nazar tashlaydigan bo‘lsak, kanalizatsiya tizimi qadimgi davrlardanoq uning turmush tarzida muhim o‘rin tutganligini ko‘rishimiz mumkin. Xonadonlarimizdan oqindi suvlarni chiqarib tashlaydigan quvur yo‘llari va inshootlar bo‘lib, ular obrez, hanik, tazar, toshnov (dashnov) kabi turli so‘zlar bilan ifodalangan. Bu so‘zlar yer osti, yomg‘ir va ifloslangan suvlarni bir joyga yig‘ish hamda chiqarib tashlash uchun shaharlarda quriladigan qurilma yoki inshoot nomini anglatgan. Oqova suv va tozalash tizimi tarixida qo‘llanilgan bu so‘zlar tadqiq obyekti sifatida olinib tahlil qilindi.
Ideographic Dictionaries as desiderata of Author Lexicography
L. Shestakova
This article presents an analytical review of dictionaries created within the framework of ideographic author lexicography as a particular direction of general author lexicography and the most productive in terms of modelling artistic images of the world. An analysis of the scholarly literature dealing with the issues of this direction is also proposed. The aim of the study is to identify the typological features of dictionaries of the selected variety, to characterise the principles of compiling such dictionaries and to identify the approaches proposed in dictionary projects. The main method of the study is dictionary criticism, which includes the description of dictionaries, their analysis and scholarly evaluation. The interest in the ideographic form of the dictionary representation of the author’s language was born in the Russian lexicography at the turn of the twenty-first century. At present, the number of such dictionaries is small in relation to the demand and desirability of their use, which is explained by the general commitment of lexicographers to the traditional alphabetic form of the description of the author’s language. The analysis of the available dictionaries makes it possible to divide them, taking into account the different typological characteristics, mainly into monographic and summary dictionaries (representing the language of one or more authors). The dictionaries of the first group demonstrate the possibility of modelling fragments of the world view of a single author with the inclusion of different lexical arrangements: the entire vocabulary of the French poems of F. Tyutchev; occasional units of M. Saltykov-Shchedrin; figurative nominations in the poetry of A. Gorodnitsky. This makes it possible to predict the expansion of the composition of objects of interpretation in “one-author” ideographic dictionaries. At the same time, the form of a summary dictionary is relevant in the description of figurative means for recreating fragments of a general artistic image of the world. The article emphasises that in order to assess the degree of expression of the ideographic base in author lexicography, it is important to take into account dictionaries of other types that contain an ideographic component (for example, in the form of thematic word lists as part of frequency dictionaries of the writer’s language). The observations made during the analysis of scholarly publications on the subject of the study indicate possible vectors of the development of ideographic author lexicography. One of them relates to the use of the method of poetic ideography developed by scholars of the Ural Semantic School.
Theme of Theatre in the Works of D. N. Mamin-Sibiryak and A. N. Ostrovsky
E. Sozina
This article examines several aspects of the theme of the theatre that are significant to the works of the renowned playwright А. N. Ostrovsky as well as the “glorifier of the Urals” D. N. Mamin-Sibiryak. The resemblance to Ostrovsky in Mamin’s play The Gold Prospectors (At the Golden Bottom) (1887–1888) is evident at the level of material and subject matter. Both Mamin’s gold finder Molokov and Ostrovsky’s merchant Bolshov (It’s a Family Affair — We’ll Settle It Ourselves) experience a similar background of deliberate bankruptcy and subsequent failure. The article devotes particular attention to the unexpected resemblance between The Gold Prospectors and Ostrovsky’s historical drama, Vasilisa Melentyeva, which was written with the participation of S. A. Gedeonov. The vividly dramatic part of Vasilisa Melentyeva was one of M. M. Abramova’s (née Heinrich), Mamin’s second wife’s, favorite roles, and her husband considered it to be her best role. The concept of the impenitent sin (N. Shalimova) was a recurring theme in the works of both Ostrovsky and Mamin. In contrast with Ostrovsky’s drama, Mamin’s social and domestic drama comedy presents a secret relationship between reasons and consequences, guilt and punishment. The ultimate outcome of the dramatic work evinces that the infliction of moral punishment has an impact on all the characters, thereby endowing the play with an apologue-like quality. The second aspect of the theatre theme in the article is an examination of the interrelation of the theatre and the public in Mamin’s stories of the mid-1880s (We Need to Encourage Art, Buyanka) and Ostrovsky’s plays, mainly his comedy Talents and Admirers. Ostrovsky differentiates the public taking into account who appeals to it: “respectable people” — or actors themselves and the entrepreneur, who often has to speak the language of money, but never forgets about the theatre’s truth. In Mamin’s narratives, the public is represented as a collective entity, symbolising the mundane and consumerist aspects of modernity. However, they are also depicted as educated provincial individuals who possess a genuine passion for the performing arts. A discernible correlation is established between Mamin’s characters and Ostrovsky’s own statements regarding the theatre and the public. This correlation is identified through an examination of Ostrovsky’s notes on the position of the theatre and dramatic art in Russia.
On Languages Generated by Signed Grammars
Ömer Eğecioğlu, Benedek Nagy
We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the words generated also have signs. We use the structure of the formal series of yields of all derivation trees over such a grammar as a method of specifying a formal language and study properties of the resulting family of languages.
Knowledge Transfer from High-Resource to Low-Resource Programming Languages for Code LLMs
Federico Cassano, John Gouwar, Francesca Lucchetti
et al.
Over the past few years, Large Language Models of Code (Code LLMs) have started to have a significant impact on programming practice. Code LLMs are also emerging as building blocks for research in programming languages and software engineering. However, Code LLMs produce impressive results on programming languages that are well represented in their training data (e.g., Java, Python, or JavaScript), but struggle with low-resource languages that have limited training data available. Low resource languages include OCaml, Racket, and several others. This paper presents an effective approach for boosting the performance of Code LLMs on low-resource languages using semi-synthetic data. Our approach, MultiPL-T, translates training data from high-resource languages into training data for low-resource languages in the following way. 1) We use a Code LLM to synthesize tests for commented code from a high-resource language, filtering out faulty tests and code with low test coverage. 2) We use a Code LLM to translate Python code to a target low-resource language, and use tests to validate the translation. We apply this approach to generate tens of thousands of validated training items for Julia, Lua, OCaml, R, and Racket. Furthermore, we use an open model (StarCoderBase) with open training data (The Stack), which allows us to decontaminate benchmarks, train models without violating licenses, and run experiments that could not otherwise be done. With MultiPL-T generated data, we present fine-tuned versions of StarCoderBase and Code Llama for Julia, Lua, OCaml, R, and Racket. On established benchmarks (MultiPL-E), these models outperform other open Code LLMs. The MultiPL-T approach is easy to apply to new languages, and is significantly more efficient and effective than alternatives such as training longer.
Logical Languages Accepted by Transformer Encoders with Hard Attention
Pablo Barcelo, Alexander Kozachinskiy, Anthony Widjaja Lin
et al.
We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transformers) and (2) AHAT (Average Hard Attention Transformers). UHAT encoders are known to recognize only languages inside the circuit complexity class ${\sf AC}^0$, i.e., accepted by a family of poly-sized and depth-bounded boolean circuits with unbounded fan-ins. On the other hand, AHAT encoders can recognize languages outside ${\sf AC}^0$), but their expressive power still lies within the bigger circuit complexity class ${\sf TC}^0$, i.e., ${\sf AC}^0$-circuits extended by majority gates. We first show a negative result that there is an ${\sf AC}^0$-language that cannot be recognized by an UHAT encoder. On the positive side, we show that UHAT encoders can recognize a rich fragment of ${\sf AC}^0$-languages, namely, all languages definable in first-order logic with arbitrary unary numerical predicates. This logic, includes, for example, all regular languages from ${\sf AC}^0$. We then show that AHAT encoders can recognize all languages of our logic even when we enrich it with counting terms. We apply these results to derive new results on the expressive power of UHAT and AHAT up to permutation of letters (a.k.a. Parikh images).
A Declarative Validator for GSOS Languages
Matteo Cimini
Rule formats can quickly establish meta-theoretic properties of process algebras. It is then desirable to identify domain-specific languages (DSLs) that can easily express rule formats. In prior work, we have developed Lang-n-Change, a DSL that includes convenient features for browsing language definitions and retrieving information from them. In this paper, we use Lang-n-Change to write a validator for the GSOS rule format, and we augment Lang-n-Change with suitable macros on our way to do so. Our GSOS validator is concise, and amounts to a few lines of code. We have used it to validate several concurrency operators as adhering to the GSOS format. Moreover, our code expresses the restrictions of the format declaratively.
Compilation Semantics for a Programming Language with Versions
Yudai Tanabe, Luthfan Anshar Lubis, Tomoyuki Aotani
et al.
Programming with versions is a paradigm that allows a program to use multiple versions of a module so that the programmer can selectively use functions from both older and newer versions of a single module. Previous work formalized $λ_{\mathrm{VL}}$, a core calculus for programming with versions, but it has not been integrated into practical programming languages. In this paper, we propose VL, a Haskell-subset surface language for $λ_{\mathrm{VL}}$ along with its compilation method. We formally describe the core part of the VL compiler, which translates from the surface language to the core language by leveraging Girard's translation, soundly infers the consistent version of expressions along with their types, and generates a multi-version interface by bundling specific-version interfaces. We conduct a case study to show how VL supports practical software evolution scenarios and discuss the method's scalability.
On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
Previous work on Dynamic Complexity has established that there exist dynamic constant-time parallel algorithms for regular tree languages and context-free languages under label or symbol changes. However, these algorithms were not developed with the goal to minimise work (or, equivalently, the number of processors). In fact, their inspection yields the work bounds $O(n^2)$ and $O(n^7)$ per change operation, respectively. In this paper, dynamic algorithms for regular tree languages are proposed that generalise the previous algorithms in that they allow unbounded node rank and leaf insertions, while improving the work bound from $O(n^2)$ to $O(n^ε)$, for arbitrary $ε> 0$. For context-free languages, algorithms with better work bounds (compared with $O(n^7)$) for restricted classes are proposed: for every $ε> 0$ there are such algorithms for deterministic context-free languages with work bound $O(n^{3+ε})$ and for visibly pushdown languages with work bound $O(n^{2+ε})$.
Separated and Shared Effects in Higher-Order Languages
Pedro H. Azevedo de Amorim, Justin Hsu
Effectful programs interact in ways that go beyond simple input-output, making compositional reasoning challenging. Existing work has shown that when such programs are ``separate'', i.e., when programs do not interfere with each other, it can be easier to reason about them. While reasoning about separated resources has been well-studied, there has been little work on reasoning about separated effects, especially for functional, higher-order programming languages. We propose two higher-order languages that can reason about sharing and separation in effectful programs. Our first language $λ_{\text{INI}}$ has a linear type system and probabilistic semantics, where the two product types capture independent and possibly-dependent pairs. Our second language $λ_{\text{INI}}^2$ is two-level, stratified language, inspired by Benton's linear-non-linear (LNL) calculus. We motivate this language with a probabilistic model, but we also provide a general categorical semantics and exhibit a range of concrete models beyond probabilistic programming. We prove soundness theorems for all of our languages; our general soundness theorem for our categorical models of $λ_{\text{INI}}^2$ uses a categorical gluing construction.
A study on the Meaning of Murong(慕容)
Junyoung Kang
Murong tribe was a branch of the Xianbei, and it was a powerful faction that established dynasties such as Former Yan(前燕) and Later Yan(後燕). Because of this, many scholars have been interested in their history and many studies have been conducted from an early age. However, research on their identity and origin is still lacking. In particular, many scholars have attempted to analyze the meaning of ‘Murong’ used as their tribal name and surname. However until today scholar's opinions are divided and there is no established theory, so it has not been completely historically verified. Therefore, in this paper I summarized the existing research history on the meaning of Murong and looked at the shortcomings of the existing research results. And I presented my own new view on the meaning of Murong. In other words, unlike the claims of existing scholars it is confirmed that ‘Murong’ is a transliteration of the word ‘Buyan’, which has the meaning of virtue, goodness, and blessing in the Altaic language world.
Sümercenin Kökeni Hakkında Yeni Bir Öneri
Ioannis Kenani̇di̇s, Evangelos C. Papakitsos
The Sumerian language still keeps the prestigious position of being the first ever written language. In this paper there are some presented linguistic data and examples, suggesting that the Sumerian is not a language isolate, as it is regarded so far, but that it may be classified as an r-Altaic language of the Bolgar branch. A proposed methodology for deducing such an inference is also presented, along with the outcomes of its application in the form of thirty-nine phonological rules.
At the origins of the Komi dialectology as a science
A. Musanov
The Komi dialectology originated in the XIX century as the scientists compiled their first lexicographic works and is associated with the names of famous researchers P.I. Savvaitov, N.P. Popov, F.I. Videman, G.S. Lytkin and others. Towards the second half of the XX century, the lexicography of the Komi language was a successfully developing scientific sphere. In the 1960s-1980s, unique dialectological materials were first introduced into scientific circulation in form of separate monographic works on the Upper Vychegda, Syktyvkar, Upper Sysola, Izhma, Pechora, Lower Vychegda, Middle Sysola, Luza-Letka, Udora dialects. This was possible by efforts of the researchers who stood at the origins of the Komi linguistic science. One of them is Tatiana Ivanovna Zhilina, a qualified specialist in the field of the Komi dialectology and lexicography, Candidate of Philological Sciences. The lexical materials accumulated by her in numerous expeditions to the basins of the Vym, Vychegda, Sysola, Luza, Letka Rivers, as well as to the Trans-Ural and Kama regions, contain more than 100 thousand units and are a reliable empirical base, the national word stock of the Komi language. In spite of the lack of proper technical equipment at that time, the professionalism and conscientious attitude to work of Tatiana Ivanovna do not allow us to doubt the reliability of the obtained results today. There are no analogues among the Finno-Ugric centers in Russia yet and they are not expected to appear in the foreseeable future.
Settlements at the mouth of the Sysola river in ancient times and the Middle Ages (on the impact of climate change on migration processes)
I. Zherebcov, I. Vaskul
The paper, based on archaeological data, considers the history of the appearance and disappearance of settlements in the territory adjacent to the mouth of the river Sysola within the modern urban district “Syktyvkar”, in ancient times and the Middle Ages, in the context of climate changes and the division of the Ural language community.
Interactive Mobile App Navigation with Uncertain or Under-specified Natural Language Commands
Andrea Burns, Deniz Arsan, Sanjna Agrawal
et al.
10 sitasi
en
Computer Science
Are local students disadvantaged? Understanding institutional, local and national sense of belonging in higher education
Mi-young Ahn, H. Davis
Research on inequality in higher education (HE) is often dominated by class-based assumptions about traditional and non-traditional students. This binary distinction emphasising students’ socio-economic status tends to oversimply the complexity of educational inequality, neglecting crucial factors which affect the perception of social position. Therefore, this study aims to investigate the understanding of inequalities in HE with new data on the meaning of locality, using evidence from comparative studies of institutions. Locality is interpreted as an inclusive concept capturing place identity as well as local at-tachments based on language, culture and the nat-ural environment. The qualitative and quantitative data were collected from 192 participants in three distinctly different HE institutions, which were deliberately selected according to their socio-economic, cultural, and institutional status. This mixed meth-ods research confirms the importance of different types of belonging at institutional, local and national levels, and their different effects on student groups. The study captures to what extent geographical mobility is associated with
A Research on the Functions of Kazakh Şeşendik Sayings
Perizat YERTAYEVA
The most important role of a society's perception of life and the transfer of cultural
codes, which have been shaped over thousands of years on the basis of lifestyle, to future
generations belongs to the molded words and narratives that occur within the oral tradition. In
this context, it is possible to find the traces of the life style, social norms and understandings
they have developed in their own way, within the oral literary tradition of Kazakh Turks,
although they are within the Turkish culture and civilization circle. One of the important genres
in the oral tradition of Kazakh Turks is "Şeşendik Sayings". In the beginning of literary studies,
the products belonging to this type, which is called "biylik /beylik sayings”, on the grounds that
the expression "Biylik / Beylik" evokes the old Kazakh social order / feudalism, it was regarded
as contrary to Soviet cultural policies and was called as "şeşendik sayings" in the Soviet Period.
Researches to be done on words of Şeşendik will make an important contribution to revealing
the cultural values of Kazakh Turks, such as their; social structure, lifestyle, perception of life
and legal order and so on.
Functional Folklore Theory is one of the most widely used theories in folklore studies
today. W. Bascom, who sets up a model on the functions of folklore products, mentions four
functions that folklore considers as important among its many functions. İlhan Başgöz adds the
"protest function" as the fifth to these four functions. In this study, in the light of the four
functions of folklore identified by W. Bascom and the "protest function" added by İlhan Başgöz,
the words of şeşendik told by the Kazakh Turks have been examined. As a result of the study,
the words of şeşendik, expressed by William Bascom and İlhan Başgöz; supporting values,
social rules and customs; educating young people by transferring education or culture to future
generations; have been observed that they fulfill the function of escaping from personal and
social pressures, and protesting
Language and Literature, Ural-Altaic languages
Features of the Genomic Distribution of Runs of Homozygosity in the Indigenous Population of Northern Eurasia at the Individual and Population Levels Based on High Density SNP Analysis
N. Kolesnikov, V. Kharkov, A. Zarubin
et al.