Hasil untuk "Indo-Iranian languages and literature"

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.

Dr. Naeema Bibi

Shahida Dilawar's novel “Zindagi aik naraz  Matan” was published in 2023 by Akas Publications Lahore, offers a unique exploration of contemporary social realities through the lens of postmodern literature. The narrative is intricately woven around three main characters include Anum (Anu), Ali (narrator) and Sarwar Javed highlighting the nuances of life spent in the complex landscape of modern offices. This paper delves into the postmodern nature of the novel, shedding light on the pervasive use of various postmodern techniques. Such as irony, playfulness,  black humour,   faction, like Metafiction, Historiographic  Metafiction, Pastiche, Intertextuality, Paranoia ،Temporal Distortion, Maximalism have been used repeatedly. In this paper, it is tried to understand the novel by studying these postmodern techniques.

Waqas Rafi Dr. Kamran Abbas Kazmi

The purpose of this article is to analyze Chaudhry Afzal's autobiography "MeraAfsana" in the colonial context. We have seen how the colonial system and its inhabitants were able to establish and rule their colonies in India. Neocolonialism is a system in which powerful nations take control of weaker nations.  By using the resources of the subjugated nation to increase their economic and statistical efficiency, they continue to strengthen themselves. This makes the economy of the settlers stronger. When a country occupies another country through its military power, it is the beginning of the formation of the colonial system. In the world where this new population is established, the occupiers impose their laws, social system and government on the local inhabitants. Western colonialism in the form of colonies, gradually set foot in the subcontinent and then they looted the wealth and capital of this colonies.  Choudhary Afzal Haq was among those who expressed the response to colonialism in that period. He was put in jail several times for the freedom movement. This article explains the services that he played in awakening the consciousness among the Muslims and strengthening their political movements, which weakened the roots of the colonial system and benefited the people of India. Choudhary Afzal has drawn a beautiful map of the racial superiority of the West, exploitation of resources, oppression and violation of human rights in his autobiography.

Ö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.

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).

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.

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.

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.

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+ε})$.

Abbas Ali Mansouri

One of the important issues in the field of Islamic philosophy is the relation between this philosophy and Greek philosophy. The main focus of the book's discussions is to study this issue. This article is intended to introduce and critique this book. In this regard, we first tried to clarify the content of the book and the main claim of the author. Finally, in the critique, we first briefly reviewed the strengths and attributes of the book and the critique of the book's form, then we entered in more detail about the book's analytical critique. The most important critique of the book is the inadequacy of the evidence and the lack of attention to the rival's arguments. According to the subject matter of the book and its scholarly methodology, it is suggested that higher education institutions consider this book as a text of educational assistance in the PhD degree in Islamic philosophy and comparative philosophy.

Kalpana Mahalingam, Anuran Maity

In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages. This concept extends the classical idea of conjugates by incorporating the Watson-Crick complementarity of DNA sequences. Our investigation initially focuses on the properties of $θ$-conjugates of words. We then define $θ$-conjugates of a language and study closure properties of certain families of languages under the $θ$-conjugate operation. Furthermore, we analyze the iterated $θ$-conjugate of both words and languages. Finally, we discuss the idea of $θ$-conjugate-free languages and examine some decidability problems related to it.

Yudai Tanabe, Luthfan Anshar Lubis, Tomoyuki Aotani et al.

While modern software development heavily uses versioned packages, programming languages rarely support the concept of versions in their semantics, which makes software updates more bulky and unsafe. This paper proposes a programming language that intrinsically supports versions. The main goals are to design core language features to support multiple versions in one program and establish a proper notion of type safety with those features. The proposed core calculus, called Lambda VL, has versioned values, each containing different values under different versions. We show the construction of the type system as an extension of coeffect calculus by mapping versions to computational resources. The type system guarantees the existence of a valid combination of versions for a program. The calculus enables programming languages to use multiple versions of a package within a program. It will serve as a basis for designing advanced language features like module systems and semantic versioning.

Fernando Lucatelli Nunes, Matthijs Vákár

We show how to apply forward and reverse mode Combinatory Homomorphic Automatic Differentiation (CHAD) to total functional programming languages with expressive type systems featuring the combination of - tuple types; - sum types; - inductive types; - coinductive types; - function types. We achieve this by analysing the categorical semantics of such types in $Σ$-types (Grothendieck constructions) of suitable categories. Using a novel categorical logical relations technique for such expressive type systems, we give a correctness proof of CHAD in this setting by showing that it computes the usual mathematical derivative of the function that the original program implements. The result is a principled, purely functional and provably correct method for performing forward and reverse mode automatic differentiation (AD) on total functional programming languages with expressive type systems.

Dmitry Golubenko

Nonterminal complexity of a context-free language is the smallest possible number of nonterminals in its generating grammar. While in general case nonterminal complexity computation problem is unsolvable, it can be computed for different families of regular languages. In this paper we study nonterminal complexity of some families of infinite regular languages.

Martin Kolář

Any class of languages $\mathbf{L}$ accepted in time $\mathbf{T}$ has a counterpart $\mathbf{NL}$ accepted in nondeterministic time $\mathbf{NT}$. It follows from the definition of nondeterministic languages that $\mathbf{L} \subseteq \mathbf{NL}$. This work shows that every sufficiently powerful language in $\mathbf{L}$ contains a string corresponding to Gödel's undecidable proposition, but this string is not contained in its nondeterministic counterpart. This inconsistency in the definition of nondeterministic languages shows that certain questions regarding nondeterministic time complexity equivalences are irrevocably ill-posed.

محسن ابوئی مهریزی, علی مداینی اول, علیرضا ولی پور

گویش‌ها و لهجه‌ها حضوری پویا و بایسته در بسیاری از زبان‌ها دارند که افزون بر تنوع ‌بخشی به‌هر زبان، در بر دارندۀ مفاهیم و نکات زبانی بسیاریند و می توانند نزدیکی به‌زبان‌های دیگر، بیان کنند. مسئلة اصلی این پژوهش، یافتن انطباق مناسب در چند اصطلاح رایج زبانشناسی در گسترۀ گویش‌ها و لهجه‌ها بین دو زبان روسی و فارسی، بر اساس انگاره‌های زبان‌شناسان هر دو زبان است. در راستای طرح این مسئله، سعی می‌شود تا ویژگی‌هایی از گویش‌ها و لهجه‌های دو زبان بررسی شده و در صورت امکان، طبقه‌بندی آن‌ها و نیز مقایسة آن‌ها با یکدیگر صورت پذیرد. هدف اصلی پژوهش، بازگشایی مفاهیم موجود در قالب هر یک از اصطلاحات مطرح شده از نظر زبانشناسان مطرح هریک از دو زبان برای معادل‌یابی صحیح و در ادامه پایه‌ریزی طرح تحقیق در زمینة گویش و لهجه‌شناسی می‌باشد. روش تحقیق به‌صورت بررسی مفهوم اصطلاحات در آرا و انگاره‌های زبان‌شناسان به‌صورت جزء به‌جزء، به‌همراه تجزیه و بررسی و در انتها نتیجه‌گیری در بارة این انگاره‌ها و انتخابی مناسب و تطبیق اصولی آن‌ها در زبان دیگر در بخش نخست بوده و در بخش دوم سعی در ارائه ویژگی‌های گویش‌ها و زبان‌ها می‌باشد. در بخش نتیجه‌گیری، بعد از ارائه تعاریف و معادل‌های مناسب، به‌اهمیت بررسی گویش‌ها و لهجه‌ها برای درک نزدیکی بیشتر میان دو زبان، بویژه در زمینه‌هایی مثل آموزش زبان اشاره می‌شود.

رضا مقدم کیا, سید آیت حسینی

پژوهش حاضر به معرفی، تحلیل و مقایسه فرایندهای بزرگ‌سازی در دو زبان فارسی و ژاپنی در چارچوب نظریه ساخت‌واژه ارزش‌گذار می‌پردازد. در این نظریه ساخت‌هایی که خودآگاه یا ناخودآگاه ارزش مصداق یا مخاطب را از دیدگاه گوینده و به داوری او منتقل می‌کنند «ساخت‌های ارزش‌گذار» نامیده می‌شوند. ساخت‌واژه از مهمترین سطوح زبانی برای تحقق ارزش‌گذاری است که امکانات فراوانی را در اختیار گویندگان هر زبان قرار می‌دهد. از جمله این امکانات می‌توان به فرایندهای کوچک‌سازی (تصغیر) و بزرگ‌سازی (تکبیر) اشاره کرد که در زبان‌های مختلف برای تولید ساخت‌های ارزش‌گذار بکار برده می‌شوند. از آن‌جا که کوچک‌سازی در تعداد بیشتری از زبان‌ها مشاهده می-شود و اغلب با افزودن وندهای خاص به انجام می‌رسد، بیشتر از بزرگ‌سازی مورد توجه پژوهشگران قرار گرفته است. برای مثال، در زبان فارسی پژوهش‌هایی در مورد کوچک‌سازی انجام شده است، اما به سازوکارهای بزرگ‌سازی، جز به صورت پراکنده در برخی کتاب‌های دستور زبان اشاره‌ای نشده است. یافته‌های تحقیق حاضر نشان داد با این که دو زبان فارسی و ژاپنی به لحاظ تکوینی به دو خانواده متفاوت تعلق دارند و به لحاظ رده‌شناسی در دو دسته متفاوت جای می‌گیرند، اما هر دو به شکلی بسیار مشابه از دو سازوکار ترکیب و دوگان‌سازی برای بزرگ‌سازی بهره می‌برند. مقاله حاضر بزرگ‌سازی با دو فرایند ترکیب و دوگان‌سازی را در فارسی و ژاپنی به تفصیل بررسی و با یکدیگر مقایسه می‌کند.

Maryam Shafaghi

The epic of Narts is based on the folklore of the Ossetian and the causes of its people’s pride. In this research, the equivalent of cultural and historical names and facts in the Russian translation of the text by A. A. Dzantiev and T. A. Hamitsaeva have been studied. Changing the writing alphabet of Ossetian language to Cyrillic in 1954 caused phonetic changes, especially in the specific names of the Ossetian. Both translators are Ossetian and fluent in the Russian language. They have tried in many cases to keep the fact in their own language. In the text of the translation, we see that even the equivalent words have been preserved in the original language of the text due to the cultural burden and the importance of the age and social hierarchy in that culture. The sounds are entirely in the Ossetian translation text. In translating proverbs, although in some cases translators rely on Russian equivalents, there are also examples of word-for-word translation. In translating units of measurement, translators used obsolete Russian words.

نرگس گنجی, فاطمه اشراقی

یکی از زمینه‌ها در پژوهش‌های ادبی بررسی پیوند هنر و ادبیات و دادوستدهایی است که از دیرباز میان این دو در جریان بوده است. از جلوه‌‌های آمیختگی ادبیات و هنر که به ‌درستی توجه پژوهش‌های پیشین را جلب نکرده آن است که عارفان ایرانی و عرب، در تألیفات منظوم و منثور خود، توسلات شگفت‌انگیزی به هنر‌های نمایشی عروسکی داشته‌اند. این پژوهش با دقت نظر در رویکرد هنرمندانة عارفان به نمایش عروسکی، به‌ویژه نمایش سایه، و با تکیه بر روش اسنادی‌ـ ‌تحلیلی این نکته را تببین می‌کند که چگونه متون عرفانی عربی و فارسی، تصویر رمزی نمایش عروسکی را به مثابۀ ابزاری برای بیان دریافت‌های شهودی به کار بسته‌اند. سپس با بررسی کهن‌ترین یافته‌های پژوهش در زمینه کاربرد تصویر رمزی نمایش عروسکی، به ترتیب تاریخی، به بیان اسناد و آثار کاربست این هنر در متون عربی و فارسی می‌پردازد تا روشن شود از چه زمانی و چگونه اندیشمندان و ادیبان عارف برای بیان اندیشه‌‌های هستی‌شناسانه و عارفانه خود به این هنر نمایشی تمسک جسته‌اند. یافته‌‌های پژوهش بیانگر آن است که بهره‌جستن ابن‌حزم اندلسی (384 ـ 456هـ.ق) از نمایش عروسکی، در تبیین اوضاع ناپایدار دنیا، از دیرینه‌ترین توسلاتِ هستی‌شناسانه به این هنر است. پس از وی، ابن‌عربی (560 ـ640ق) و گروهی از ادیبان صوفیه در تبیین اندیشه‌‌های خود به‌ویژه مباحث «وحدت وجود» و «توحید افعالی» با تمسک به این هنر سنتی توانسته‌اند پیچیده‌ترین مفاهیم هستی‌شناسانه را به مخاطبان منتقل سازند.

Muhammad Qasim

This Research article is an analytical study of english translation of the poetry of Mirza Asdullah Khan Ghalib by Sarfraz. K. Niazi. This translation was published under the title of Love Sonnets of Ghalib by Rupa & Co New Dehli in 2002. This is the first complete english translation, explication, lexicon and translitration of Mirza Ghalib's Urdu Poetry in English. While translating Ghalib, Sarfraz Niazi has adopted much and more from Yousaf Hussain Khan's Urdu Ghazals of Ghalib but didnot mention in preface or elsewhere. There are so many places On the pages of Love Sonnets of Ghalib Where these translations seem to be plagerised.