Tootfinder

Intermediate Languages Matter: Formal Languages and LLMs affect Neurosymbolic Reasoning
Alexander Beiser, David Penz, Nysret Musliu
https://arxiv.org/abs/2509.04083 https://

Intermediate Languages Matter: Formal Languages and LLMs affect Neurosymbolic Reasoning
Large language models (LLMs) achieve astonishing results on a wide range of tasks. However, their formal reasoning ability still lags behind. A promising approach is Neurosymbolic LLM reasoning. It works by using LLMs as translators from natural to formal languages and symbolic solvers for deriving correct results. Still, the contributing factors to the success of Neurosymbolic LLM reasoning remain unclear. This paper demonstrates that one previously overlooked factor is the choice of the forma…

What if I ask in \textit{alia lingua}? Measuring Functional Similarity Across Languages
Debangan Mishra, Arihant Rastogi, Agyeya Negi, Shashwat Goel, Ponnurangam Kumaraguru
https://arxiv.org/abs/2509.04032

What if I ask in \textit{alia lingua}? Measuring Functional Similarity Across Languages
How similar are model outputs across languages? In this work, we study this question using a recently proposed model similarity metric $κ_p$ applied to 20 languages and 47 subjects in GlobalMMLU. Our analysis reveals that a model's responses become increasingly consistent across languages as its size and capability grow. Interestingly, models exhibit greater cross-lingual consistency within themselves than agreement with other models prompted in the same language. These results highlight not o…

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Janus-faces of temporal constraint languages: a dichotomy of expressivity
Johanna Brunar, Michael Pinsker, Moritz Sch\"obi
https://arxiv.org/abs/2509.04347 https://

Janus-faces of temporal constraint languages: a dichotomy of expressivity
The Bodirsky-Kára classification of temporal constraint languages stands as one of the earliest and most seminal complexity classifications within infinite-domain Constraint Satisfaction Problems (CSPs), yet it remains one of the most mysterious in terms of algorithms and algebraic invariants for the tractable cases. We show that those temporal languages which do not pp-construct EVERYTHING (and thus by the classification are solvable in polynomial time) have, in fact, very limited expressive …

Internal languages of locally cartesian closed $(\infty,1)$-categories
El Mehdi Cherradi
https://arxiv.org/abs/2509.03371 https://arxiv.org/pdf/2509.03371

Internal languages of locally cartesian closed $(\infty,1)$-categories
We establish a DK-equivalence between the relative category of $π$-tribes and the relative category of locally cartesian closed quasicategories. From this follows one of the internal languages conjecture: Martin-Löf type theory with dependent sums, intensional identity types, and dependent products satisfying functional extensionality is the internal language of locally cartesian closed $(\infty,1)$-categories.

MultiWikiQA: A Reading Comprehension Benchmark in 300 Languages
Dan Saattrup Smart
https://arxiv.org/abs/2509.04111 https://arxiv.org/pdf/2509.04111

MultiWikiQA: A Reading Comprehension Benchmark in 300+ Languages
We introduce a new reading comprehension dataset, dubbed MultiWikiQA, which covers 306 languages. The context data comes from Wikipedia articles, with questions generated by an LLM and the answers appearing verbatim in the Wikipedia articles. We conduct a crowdsourced human evaluation of the fluency of the generated questions across 30 of the languages, providing evidence that the questions are of good quality. We evaluate 6 different language models, both decoder and encoder models of varying …

Researchers find OpenAI's o1 can analyze languages like a human expert, including inferring the phonological rules of made-up languages without prior knowledge (Steve Nadis/Quanta Magazine)
https://www.quantamagazine.org/in-a-first-

In a First, AI Models Analyze Language As Well As a Human Expert | Quanta Magazine
If language is what makes us human, what does it mean now that large language models have gained “metalinguistic” abilities?

IMO the reason why people yearn for tools that generate code is that programming is broken—everything now is giant layer cakes of huge, complex and intransparent frameworks designed by and for large teams in giant tech companies.
The same tech companies that flooded programming with overly complex tools, endless toolchains, new programming languages du jour every few years, required backwards-compatibility breaking updates and mandatory design overhauls are now selling you “AI” to generate code for the mess they made.

A substitution lemma for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel, Mengfan Lyu
https://arxiv.org/abs/2509.02117 https://ar…

A substitution lemma for multiple context-free languages
We present a new criterion for proving that a language is not multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of $F_2\times F_2$. Our result is in contrast to Kanazawa et al. [2014, Theory Comput. Syst.] who proved that it was not possible to generalise the standard pumping lemma for context-free languages to multiple context-free languages, and Kanazawa [2019, Inform. and …

from my link log —
Control structures in programming languages: from goto to algebraic effects.
http://xavierleroy.org/control-structures/
saved 2025-11-03

Was recently reminded about the time me and my brothers were studying high school German with the aid of some bilingual story that had each page printed in both languages, and came across the word "Stuhlgang".
From that point forth, any time we came across a stool of the sort you sit on (as opposed to the kind you flush down the toilet) we'd refer to it as a Stuhlgang.

Every day, some 2 billion people around the world use privacy-protection tools supported by the Open Technology Fund.
When people in China escape their government’s firewalls and censorship software
—now so dense that the system has been called the “locknet”
—or when users in Cuba or Myanmar evade cruder internet blocks,
they can access material written in their own languages and read stories they would otherwise never see.
Both the access and some of the informa…

America Surrenders in the Global Information Wars
The U.S. is reorienting its foreign policy to protect governments that manipulate and suppress information.

Messing the whole weekend with the WordPress instance of a friend. He's been using an old plugin for multiple languages. The plugin is abandoned since 2015 and doesn't support newer PHP versions. Wordpress and the other plugins is about to no longer support the old PHP version.
At first I thought about writing a conversion tool to another plugin. Spend some considerable time setting up a test environment as well. Eventually it turns out group of people forked the problematic p…

Programming in Forth is oddly relaxing. I want to forget about modern languages and embrace antique ones

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for Reachability ...
Songlin Jia, Guannan Wei, Siyuan He, Yuyan Bao, Tiark Rompf

The 85th edition of De Programmatica Ipsum is out!
This month, we look at the strategies used by major programming languages to manage memory; in our Vidéothèque section, we learn how C and C manage memory in a video by Ryan Baker; and in the Library section, we review "What Every Programmer Should Know About Memory" by Ulrich Drepper.

Exploring NLP Benchmarks in an Extremely Low-Resource Setting
Ulin Nuha, Adam Jatowt
https://arxiv.org/abs/2509.03962 https://arxiv.org/pdf/2509.03962

Exploring NLP Benchmarks in an Extremely Low-Resource Setting
The effectiveness of Large Language Models (LLMs) diminishes for extremely low-resource languages, such as indigenous languages, primarily due to the lack of labeled data. Despite growing interest, the availability of high-quality natural language processing (NLP) datasets for these languages remains limited, making it difficult to develop robust language technologies. This paper addresses such gap by focusing on Ladin, an endangered Romance language, specifically targeting the Val Badia varian…

Store Languages of Turing Machines and Counter Machines
Noah Friesen, Oscar H. Ibarra, Jozef Jir\'asek, Ian McQuillan
https://arxiv.org/abs/2509.02828 https://

Store Languages of Turing Machines and Counter Machines
The store language of an automaton is the set of store configurations (state and store contents, but not the input) that can appear as an intermediate step in an accepting computation. A one-way nondeterministic finite-visit Turing machine (fvNTM) is a Turing machine with a one-way read-only input tape, and a single worktape, where there is some number $k$ such that in every accepting computation, each worktape cell is visited at most $k$ times. We show that the store language of every fvNTM is…

How inaccurate AI translations of Wikipedia pages, which AI models use for training, may cause a doom spiral that further marginalizes vulnerable languages (Jacob Judah/MIT Technology Review)
https://www.technologyreview.com/2025/09/25/11240…

How AI and Wikipedia have sent vulnerable languages into a doom spiral
Machine translators have made it easier than ever to create error-plagued Wikipedia articles in obscure languages. What happens when AI models get trained on junk pages?

Are We SOLID Yet? An Empirical Study on Prompting LLMs to Detect Design Principle Violations
Fatih Pehlivan, Ar\c{c}in \"Ulk\"u Erg\"uzen, Sahand Moslemi Yengejeh, Mayasah Lami, Anil Koyuncu
https://arxiv.org/abs/2509.03093

Are We SOLID Yet? An Empirical Study on Prompting LLMs to Detect Design Principle Violations
Traditional static analysis methods struggle to detect semantic design flaws, such as violations of the SOLID principles, which require a strong understanding of object-oriented design patterns and principles. Existing solutions typically focus on individual SOLID principles or specific programming languages, leaving a gap in the ability to detect violations across all five principles in multi-language codebases. This paper presents a new approach: a methodology that leverages tailored prompt e…

Characterization of Speech Similarity Between Australian Aboriginal and High-Resource Languages: A Case Study on Dharawal
Ting Dang, Trini Manoj Jeyaseelan, Eliathamby Ambikairajah, Vidhyasaharan Sethu
https://arxiv.org/abs/2509.01419

Characterization of Speech Similarity Between Australian Aboriginal and High-Resource Languages: A Case Study on Dharawal
Australian Aboriginal languages are of significant cultural and linguistic value but remain severely underrepresented in modern speech AI systems. While state-of-the-art speech foundation models and automatic speech recognition excel in high-resource settings, they often struggle to generalize to low-resource languages, especially those lacking clean, annotated speech data. In this work, we collect and clean a speech dataset for Dharawal, a low-resource Australian Aboriginal language, by carefu…

Milco: Learned Sparse Retrieval Across Languages via a Multilingual Connector
Thong Nguyen, Yibin Lei, Jia-Huei Ju, Eugene Yang, Andrew Yates
https://arxiv.org/abs/2510.00671 ht…

Milco: Learned Sparse Retrieval Across Languages via a Multilingual Connector
Learned Sparse Retrieval (LSR) combines the efficiency of bi-encoders with the transparency of lexical matching, but existing approaches struggle to scale beyond English. We introduce MILCO, an LSR architecture that maps queries and documents from different languages into a shared English lexical space via a multilingual connector. MILCO is trained with a specialized two-stage regime that combines Sparse Alignment Pretraining with contrastive training to provide representation transparency and …

Got the 🇨🇭 #SwissAI #Apertus model - one of the very few completely opensource LLMs - running locally!
Next step: finetuning on historical low-resource languages (like Middle High German).
#FOSS

Denny Vrandencic is guiding us through the long history of Wikipedia and the Semantic Web in his brilliant keynote at #ISWC2025 from Aristotle to Wikifunctions, enabling an automatically generated (multilingual) Wikipedia also in lesser represented languages
#semanticweb

Crosslisted article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning
Mukherji, Patil, Aditya, Shakarian, Parkar, Pokala, Dorman, Simari

Shape and word parts combine linearly in the Bouba–Kiki effect https://link.springer.com/article/10.3758/s13414-025-03151-1

Shape and word parts combine linearly in the Bouba–Kiki effect - Attention, Perception, & Psychophysics
Languages have evolved in part due to cross-modal associations between shape and sound. A famous example is the Bouba–Kiki effect, wherein humans associate words like bouba/kiki to round/angular shapes. How does the Bouba–Kiki effect work for natural words and shapes that contain a mixture of features? If the effect is holistic, the effect for a composite stimulus would not be explainable using the parts. If the effect is compositional, it will be. Here we provide evidence for the latter po…

L3Cube-IndicHeadline-ID: A Dataset for Headline Identification and Semantic Evaluation in Low-Resource Indian Languages
Nishant Tanksale, Tanmay Kokate, Darshan Gohad, Sarvadnyaa Barate, Raviraj Joshi
https://arxiv.org/abs/2509.02503

L3Cube-IndicHeadline-ID: A Dataset for Headline Identification and Semantic Evaluation in Low-Resource Indian Languages
Semantic evaluation in low-resource languages remains a major challenge in NLP. While sentence transformers have shown strong performance in high-resource settings, their effectiveness in Indic languages is underexplored due to a lack of high-quality benchmarks. To bridge this gap, we introduce L3Cube-IndicHeadline-ID, a curated headline identification dataset spanning ten low-resource Indic languages: Marathi, Hindi, Tamil, Gujarati, Odia, Kannada, Malayalam, Punjabi, Telugu, Bengali and Engli…

How inaccurate AI translations of Wikipedia pages, which AI models use for training, may cause a doom spiral that further marginalizes vulnerable languages (Jacob Judah/MIT Technology Review)
https://www.technologyreview.com/2025/09/25/11240…

How AI and Wikipedia have sent vulnerable languages into a doom spiral
Machine translators have made it easier than ever to create error-plagued Wikipedia articles in obscure languages. What happens when AI models get trained on junk pages?

https://linuxiac.com/new-movie-python-the-documentary-traces-the-languages-story/

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 83330 nodes and 2095962 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/n…

Mixing languages can be confusing
#linguistics #languages #language

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Modal Abstractions for Virtualizing Memory Addresses
Ismail Kuru, Colin S. Gordon
h…

Video of my SPLSS 2025 talk “Do Programming Languages Fulfill Requirements? Should They?” is online.
https://www.youtube.com/watch?v=rhC6bBa8Rf8

Meta-Pretraining for Zero-Shot Cross-Lingual Named Entity Recognition in Low-Resource Philippine Languages
David Demitri Africa, Suchir Salhan, Yuval Weiss, Paula Buttery, Richard Diehl Martinez
https://arxiv.org/abs/2509.02160

Meta-Pretraining for Zero-Shot Cross-Lingual Named Entity Recognition in Low-Resource Philippine Languages
Named-entity recognition (NER) in low-resource languages is usually tackled by finetuning very large multilingual LMs, an option that is often infeasible in memory- or latency-constrained settings. We ask whether small decoder LMs can be pretrained so that they adapt quickly and transfer zero-shot to languages unseen during pretraining. To this end we replace part of the autoregressive objective with first-order model-agnostic meta-learning (MAML). Tagalog and Cebuano are typologically similar …

#memorysafe implementation of the C and C programming languages

Safe Memory Reclamation Techniques
Ajay Singh
https://arxiv.org/abs/2509.02457 https://arxiv.org/pdf/2509.02457

Safe Memory Reclamation Techniques
Safe memory reclamation is crucial to memory safety for optimistic and lock-free concurrent data structures in non garbage collected programming languages. However, several challenges arise in designing an ideal safe memory reclamation algorithm, including achieving high speed and scalability, easy of use for programmers, applicability to wide class of data structures, managing the large memory footprint caused by delayed freeing of memory for safety and performance, and avoiding asymmetric ove…

Bias beyond Borders: Global Inequalities in AI-Generated Music
Ahmet Solak, Florian Gr\"otschla, Luca A. Lanzend\"orfer, Roger Wattenhofer
https://arxiv.org/abs/2510.01963

Bias beyond Borders: Global Inequalities in AI-Generated Music
While recent years have seen remarkable progress in music generation models, research on their biases across countries, languages, cultures, and musical genres remains underexplored. This gap is compounded by the lack of datasets and benchmarks that capture the global diversity of music. To address these challenges, we introduce GlobalDISCO, a large-scale dataset consisting of 73k music tracks generated by state-of-the-art commercial generative music models, along with paired links to 93k refer…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Autoformalization in the Wild: Assessing LLMs on Real-World Mathematical Definitions
Lan Zhang, Marco Valentino, Andre Freitas

THE LESSER-KNOWN PROGRAMMING LANGUAGES #8: LAIDBACK
This language was developed at the Marin County Center for T'ai Chi,
Mellowness and Computer Programming (now defunct), as an alternative to
the more intense atmosphere in nearby Silicon Valley.
The center was ideal for programmers who liked to soak in hot tubs while
they worked. Unfortunately few programmers could survive there because the
center outlawed Pizza and Coca-Cola in favor of Tofu and Perrier…

Google says NotebookLM's Video Overviews now support 80 languages, and Audio Overviews now provide more detailed non-English summaries (Lauren Forristal/TechCrunch)
https://techcrunch.com/2025/08/25/notebooklms-video-overview-feature-now-su…

NotebookLM’s Video Overview feature now supports 80 languages | TechCrunch
NotebookLM’s Video Overviews now supports 80 languages, including French and Spanish.

Automatic Speech Recognition (ASR) for African Low-Resource Languages: A Systematic Literature Review
Sukairaj Hafiz Imam, Tadesse Destaw Belay, Kedir Yassin Husse, Ibrahim Said Ahmad, Idris Abdulmumin, Hadiza Ali Umar, Muhammad Yahuza Bello, Joyce Nakatumba-Nabende, Seid Muhie Yimam, Shamsuddeen Hassan Muhammad
https://arxiv.org/abs/2510.…

Automatic Speech Recognition (ASR) for African Low-Resource Languages: A Systematic Literature Review
ASR has achieved remarkable global progress, yet African low-resource languages remain rigorously underrepresented, producing barriers to digital inclusion across the continent with more than +2000 languages. This systematic literature review (SLR) explores research on ASR for African languages with a focus on datasets, models and training methods, evaluation techniques, challenges, and recommends future directions. We employ the PRISMA 2020 procedures and search DBLP, ACM Digital Library, Goog…

Interesting way to represent uncertain or vague information into #knowledgegraphs (as e.g. easier integration of LLM/Deep Learning Results into KGs) via "Fuzzy OWL". Paper by Fernando Bobillo & Umberto Straccia: Fuzzy Ontology Representation using OWL 2

Fuzzy Ontology Representation using OWL 2
The need to deal with vague information in Semantic Web languages is rising in importance and, thus, calls for a standard way to represent such information. We may address this issue by either extending current Semantic Web languages to cope with vagueness, or by providing a procedure to represent such information within current standard languages and tools. In this work, we follow the latter approach, by identifying the syntactic differences that a fuzzy ontology language has to cope with, and…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Sy...
Mickael Randour

from my link log —
Sapir-Whorf does not apply to programming languages.
https://buttondown.com/hillelwayne/archive/sapir-whorf-does-not-apply-to-programming/
saved 2025-08-21

Sapir-Whorf does not apply to Programming Languages
Linguistics is about human languages, not programming ones

[2025-09-04 Thu (UTC), 1 new article found for cs.PL Programming Languages]
toXiv_bot_toot

Sequent Calculi for Data-Aware Modal Logics
Carlos Areces (Universidad Nacional de Cordoba,CONICET), Valentin Cassano (Universidad Nacional de Rio Cuarto,CONICET), Danae Dutto (Universidad Nacional de Cordoba,CONICET), Raul Fervari (Universidad Nacional de Cordoba,CONICET)
https://arxiv.org/abs/2510.01868

Sequent Calculi for Data-Aware Modal Logics
Data-aware modal logics offer a powerful formalism for reasoning about semi-structured queries in languages such as DataGL, XPath, and GQL. In brief, these logics can be viewed as modal systems capable of expressing both reachability statements and data-aware properties, such as value comparisons. One particularly expressive logic in this landscape is HXpathD, a hybrid modal logic that captures not only the navigational core of XPath but also data comparisons, node labels (keys), and key-based …

Scalable Thread-Safety Analysis of Java Classes with CodeQL
Bj{\o}rnar Haugstad J{\aa}tten, Simon Boye J{\o}rgensen, Rasmus Petersen, Ra\'ul Pardo
https://arxiv.org/abs/2509.02022

Scalable Thread-Safety Analysis of Java Classes with CodeQL
In object-oriented languages software developers rely on thread-safe classes to implement concurrent applications. However, determining whether a class is thread-safe is a challenging task. This paper presents a highly scalable method to analyze thread-safety in Java classes. We provide a definition of thread-safety for Java classes founded on the correctness principle of the Java memory model, data race freedom. We devise a set of properties for Java classes that are proven to ensure thread-sa…

An LLM-enabled semantic-centric framework to consume privacy policies
Rui Zhao, Vladyslav Melnychuk, Jun Zhao, Jesse Wright, Nigel Shadbolt
https://arxiv.org/abs/2509.01716 http…

An LLM-enabled semantic-centric framework to consume privacy policies
In modern times, people have numerous online accounts, but they rarely read the Terms of Service or Privacy Policy of those sites, despite claiming otherwise, due to the practical difficulty in comprehending them. The mist of data privacy practices forms a major barrier for user-centred Web approaches, and for data sharing and reusing in an agentic world. Existing research proposed methods for using formal languages and reasoning for verifying the compliance of a specified policy, as a potentia…

"Programmers, as users of compilers, experience Wittgenstein’s observation every day; newer programming languages provide more sophisticated ways to express algorithms, thereby expanding the limits of their own programming capacity, LLMs and “vibe coding” notwithstanding."
https://deprogrammaticaipsum.com/vikra…

Vikram Chandra
There are a lot of different things we could have talked about in the Library section of an edition dedicated to compilers; one obvious choice would have been to talk about the quintessential compiler theory book, the 1986 "Dragon Book" also known as "Compilers: Principles, Techniques, and Tools" by Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. As excellent and Wikipedia-worthy as this one is, that is not the book we will talk about here.

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic ...
Paul M. Riechers, Thomas J. Elliott

[2025-09-05 Fri (UTC), 1 new article found for cs.PL Programming Languages]
toXiv_bot_toot

EuroSpeech: A Multilingual Speech Corpus
Samuel Pfisterer, Florian Gr\"otschla, Luca A. Lanzend\"orfer, Florian Yan, Roger Wattenhofer
https://arxiv.org/abs/2510.00514

EuroSpeech: A Multilingual Speech Corpus
Recent progress in speech processing has highlighted that high-quality performance across languages requires substantial training data for each individual language. While existing multilingual datasets cover many languages, they often contain insufficient data for most languages. Thus, trained models perform poorly on the majority of the supported languages. Our work addresses this challenge by introducing a scalable pipeline for constructing speech datasets from parliamentary recordings. The p…

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

ArabEmoNet: A Lightweight Hybrid 2D CNN-BiLSTM Model with Attention for Robust Arabic Speech Emotion Recognition
Ali Abouzeid, Bilal Elbouardi, Mohamed Maged, Shady Shehata
https://arxiv.org/abs/2509.01401

ArabEmoNet: A Lightweight Hybrid 2D CNN-BiLSTM Model with Attention for Robust Arabic Speech Emotion Recognition
Speech emotion recognition is vital for human-computer interaction, particularly for low-resource languages like Arabic, which face challenges due to limited data and research. We introduce ArabEmoNet, a lightweight architecture designed to overcome these limitations and deliver state-of-the-art performance. Unlike previous systems relying on discrete MFCC features and 1D convolutions, which miss nuanced spectro-temporal patterns, ArabEmoNet uses Mel spectrograms processed through 2D convolutio…

When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking
Siyuan He, Songlin Jia, Yuyan Bao, Tiark Rompf
https://arxiv.org/abs/2509.04253 https:/…

When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking
Static resource management in higher-order functional languages remains elusive due to tensions between control, expressiveness, and flexibility. Region-based systems [Grossman et al. 2002; Tofte et al. 2001] offer control over lifetimes and expressive in-region sharing, but restrict resources to lexical scopes. Rust, an instance of ownership types [Clarke et al. 2013], offers non-lexical lifetimes and robust safety guarantees, yet its global invariants make common sharing patterns hard to expr…

Virtual Group Knowledge and Group Belief in Topological Evidence Models (Extended Version)
Alexandru Baltag, Malvin Gattinger, Djanira Gomes
https://arxiv.org/abs/2509.00184 htt…

Virtual Group Knowledge and Group Belief in Topological Evidence Models (Extended Version)
We study notions of (virtual) group knowledge and group belief within multi-agent evidence models, obtained by extending the topological semantics of evidence-based belief and fallible knowledge from individuals to groups. We completely axiomatize and show the decidability of the logic of ("hard" and "soft") group evidence, and do the same for an especially interesting fragment of it: the logic of group knowledge and group belief. We also extend these languages with dynamic evidence-sharing ope…

Beyond Single LLMs: Enhanced Code Generation via Multi-Stage Performance-Guided LLM Orchestration
Huashan Chen, Zhenyu Qi, Haotang Li, Hong Chen, Jinfu Chen, Kebin Peng, In Kee Kim, Kyu Hyung Lee, Sen He
https://arxiv.org/abs/2510.01379

Beyond Single LLMs: Enhanced Code Generation via Multi-Stage Performance-Guided LLM Orchestration
While Large Language Models (LLMs) have become the predominant paradigm for automated code generation, current single-model approaches fundamentally ignore the heterogeneous computational strengths that different models exhibit across programming languages, algorithmic domains, and development stages. This paper challenges the single-model convention by introducing a multi-stage, performance-guided orchestration framework that dynamically routes coding tasks to the most suitable LLMs within a s…

[2025-09-05 Fri (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Semantically Reflected Programs
Eduard Kamburjan, Vidar Norstein Klungre, Yuanwei Qu, Rudolf Schlatte, Egor V. Kostylev, Martin Giese, Einar Broch Johnsen
https://arxiv.org/abs/2509.03318

Semantically Reflected Programs
This paper addresses the dichotomy between the formalization of structural and the formalization of behavioral knowledge by means of semantically lifted programs, which explore an intuitive connection between programs and knowledge graphs. While knowledge graphs and ontologies are eminently useful to represent formal knowledge about a system's individuals and universals, programming languages are designed to describe the system's evolution. To address this dichotomy, we introduce a semantic lif…

from my link log —
Let's take esoteric programming languages seriously.
https://arxiv.org/abs/2505.15327
saved 2025-10-11 https://dotat.at/:/XKTKR.…

Let's Take Esoteric Programming Languages Seriously
Esoteric programming languages are challenging to learn, but their unusual features and constraints may serve to improve programming ability. From languages designed to be intentionally obtuse (e.g. INTERCAL) to others targeting artistic expression (e.g. Piet) or exploring the nature of computation (e.g. Fractan), there is rich variety in the realm of esoteric programming languages. This essay examines the counterintuitive appeal of esoteric languages and seeks to analyse reasons for this popul…

Tencent open sources translation models Hunyuan-MT-7B and Hunyuan-MT-Chimera-7B, which support 33 languages, claiming they beat established models in benchmarks (Jonathan Kemper/The Decoder)
https://the-decoder.com/tencent-open-sources-two-high-performing…

Tencent open sources two high-performing translation models
Chinese tech giant Tencent has open sourced two specialized translation models, claiming they outperform established tools like Google Translate in international benchmarks.

A RoBERTa-Based Functional Syntax Annotation Model for Chinese Texts
Han Xiaohui, Zhang Yunlong, Guo Yuxi
https://arxiv.org/abs/2509.04046 https://arxiv.or…

A RoBERTa-Based Functional Syntax Annotation Model for Chinese Texts
Systemic Functional Grammar and its branch, Cardiff Grammar, have been widely applied to discourse analysis, semantic function research, and other tasks across various languages and texts. However, an automatic annotation system based on this theory for Chinese texts has not yet been developed, which significantly constrains the application and promotion of relevant theories. To fill this gap, this research introduces a functional syntax annotation model for Chinese based on RoBERTa (Robustly O…

[2025-09-04 Thu (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[3/3]:
- Science Across Languages: Assessing LLM Multilingual Translation of Scientific Papers
Hannah Calzi Kleidermacher, James Zou

word_adjacency: Word Adjacency Networks
Directed Networks of word adjacency in texts of several languages including English, French, Spanish and Japanese.
This network has 2704 nodes and 8300 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/word_ad

Agentic Specification Generator for Move Programs
Yu-Fu Fu, Meng Xu, Taesoo Kim
https://arxiv.org/abs/2509.24515 https://arxiv.org/pdf/2509.24515

Agentic Specification Generator for Move Programs
While LLM-based specification generation is gaining traction, existing tools primarily focus on mainstream programming languages like C, Java, and even Solidity, leaving emerging and yet verification-oriented languages like Move underexplored. In this paper, we introduce MSG, an automated specification generation tool designed for Move smart contracts. MSG aims to highlight key insights that uniquely present when applying LLM-based specification generation to a new ecosystem. Specifically, MSG …

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Discovering Software Parallelization Points Using Deep Neural Networks
Izavan dos S. Correia, Henrique C. T. Santos, Tiago A. E. Ferreira

MENLO: From Preferences to Proficiency - Evaluating and Modeling Native-like Quality Across 47 Languages
Chenxi Whitehouse, Sebastian Ruder, Tony Lin, Oksana Kurylo, Haruka Takagi, Janice Lam, Nicol\`o Busetto, Denise Diaz
https://arxiv.org/abs/2509.26601

MENLO: From Preferences to Proficiency - Evaluating and Modeling Native-like Quality Across 47 Languages
Ensuring native-like quality of large language model (LLM) responses across many languages is challenging. To address this, we introduce MENLO, a framework that operationalizes the evaluation of native-like response quality based on audience design-inspired mechanisms. Using MENLO, we create a dataset of 6,423 human-annotated prompt-response preference pairs covering four quality dimensions with high inter-annotator agreement in 47 language varieties. Our evaluation reveals that zero-shot LLM j…

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Abstract Interpretation of Temporal Safety Effects of Higher Order Programs
Mihai Nicola, Chaitanya Agarwal, Eric Koskinen, Thomas Wies

Crosslisted article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- REFINESTAT: Efficient Exploration for Probabilistic Program Synthesis
Madhav Kanda, Shubham Ugare, Sasa Misailovic

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- List of Results on the \v{C}ern\'y Conjecture and Reset Thresholds for Synchronizing Automata
Mikhail V. Volkov

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Mean-payoff and Energy Discrete Bidding Games
Guy Avni, Suman Sadhukhan
https://…

Languages Still Left Behind: Toward a Better Multilingual Machine Translation Benchmark
Chihiro Taguchi, Seng Mai, Keita Kurabe, Yusuke Sakai, Georgina Agyei, Soudabeh Eslami, David Chiang
https://arxiv.org/abs/2508.20511

Languages Still Left Behind: Toward a Better Multilingual Machine Translation Benchmark
Multilingual machine translation (MT) benchmarks play a central role in evaluating the capabilities of modern MT systems. Among them, the FLORES+ benchmark is widely used, offering English-to-many translation data for over 200 languages, curated with strict quality control protocols. However, we study data in four languages (Asante Twi, Japanese, Jinghpaw, and South Azerbaijani) and uncover critical shortcomings in the benchmark's suitability for truly multilingual evaluation. Human assessments…

word_adjacency: Word Adjacency Networks
Directed Networks of word adjacency in texts of several languages including English, French, Spanish and Japanese.
This network has 2704 nodes and 8300 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/word_ad

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Cobham's theorem for the Gaussian integers
\'Alvaro Bustos-Gajardo, Robbert Fokkink, Reem Yassawi

[2025-09-03 Wed (UTC), 6 new articles found for cs.PL Programming Languages]
toXiv_bot_toot

[2025-10-03 Fri (UTC), no new articles found for cs.PL Programming Languages]
toXiv_bot_toot

JGU Mainz's Submission to the WMT25 Shared Task on LLMs with Limited Resources for Slavic Languages: MT and QA
Hossain Shaikh Saadi, Minh Duc Bui, Mario Sanz-Guerrero, Katharina von der Wense
https://arxiv.org/abs/2509.22490

JGU Mainz's Submission to the WMT25 Shared Task on LLMs with Limited Resources for Slavic Languages: MT and QA
This paper presents the JGU Mainz submission to the WMT25 Shared Task on LLMs with Limited Resources for Slavic Languages: Machine Translation and Question Answering, focusing on Ukrainian, Upper Sorbian, and Lower Sorbian. For each language, we jointly fine-tune a Qwen2.5-3B-Instruct model for both tasks with parameter-efficient finetuning. Our pipeline integrates additional translation and multiple-choice question answering (QA) data. For Ukrainian QA, we further use retrieval-augmented gener…

Type-Based Incorrectness Reasoning
Zhe Zhou, Benjamin Delaware, Suresh Jagannathan
https://arxiv.org/abs/2509.01511 https://arxiv.org/pdf/2509.01511…

Type-Based Incorrectness Reasoning
A coverage type generalizes refinement types found in many functional languages with support for must-style underapproximate reasoning. Property-based testing frameworks are one particularly useful domain where such capabilities are useful as they allow us to verify the completeness, as well as safety, of test generators. There is a surprising connection between the kind of underapproximate reasoning coverage types offer and the style of reasoning enabled by recently proposed Incorrectness Logi…

Flavors of Moonshine: Tiny Specialized ASR Models for Edge Devices
Evan King, Adam Sabra, Manjunath Kudlur, James Wang, Pete Warden
https://arxiv.org/abs/2509.02523 https://

Flavors of Moonshine: Tiny Specialized ASR Models for Edge Devices
We present the Flavors of Moonshine, a suite of tiny automatic speech recognition (ASR) models specialized for a range of underrepresented languages. Prevailing wisdom suggests that multilingual ASR models outperform monolingual counterparts by exploiting cross-lingual phonetic similarities. We challenge this assumption, showing that for sufficiently small models (27M parameters), training monolingual systems on a carefully balanced mix of high-quality human-labeled, pseudo-labeled, and synthet…

[2025-10-03 Fri (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Regression Language Models for Code
Yash Akhauri, Xingyou Song, Arissa Wongpanich, Bryan Lewandowski, Mohamed S. Abdelfattah
https://arxiv.org/abs/2509.26476 https://

Regression Language Models for Code
We study code-to-metric regression: predicting numeric outcomes of code executions, a challenging task due to the open-ended nature of programming languages. While prior methods have resorted to heavy and domain-specific feature engineering, we show that a single unified Regression Language Model (RLM) can simultaneously predict directly from text, (i) the memory footprint of code across multiple high-level languages such as Python and C++, (ii) the latency of Triton GPU kernels, and (iii) the …

[2025-09-03 Wed (UTC), 4 new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Formalizing Linear Motion G-code for Invariant Checking and Differential Testing of Fabrication Tools
Yumeng He, Chandrakana Nandi, Sreepathi Pai
https://arxiv.org/abs/2509.00699

Formalizing Linear Motion G-code for Invariant Checking and Differential Testing of Fabrication Tools
The computational fabrication pipeline for 3D printing is much like a compiler - users design models in Computer Aided Design (CAD) tools that are lowered to polygon meshes to be ultimately compiled to machine code by 3D slicers. For traditional compilers and programming languages, techniques for checking program invariants are well-established. Similarly, methods like differential testing are often used to uncover bugs in compilers themselves, which makes them more reliable. The fabrication pi…

PalmX 2025: The First Shared Task on Benchmarking LLMs on Arabic and Islamic Culture
Fakhraddin Alwajih, Abdellah El Mekki, Hamdy Mubarak, Majd Hawasly, Abubakr Mohamed, Muhammad Abdul-Mageed
https://arxiv.org/abs/2509.02550

PalmX 2025: The First Shared Task on Benchmarking LLMs on Arabic and Islamic Culture
Large Language Models (LLMs) inherently reflect the vast data distributions they encounter during their pre-training phase. As this data is predominantly sourced from the web, there is a high chance it will be skewed towards high-resourced languages and cultures, such as those of the West. Consequently, LLMs often exhibit a diminished understanding of certain communities, a gap that is particularly evident in their knowledge of Arabic and Islamic cultures. This issue becomes even more pronounce…

Permutation closure for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel, Mengfan Lyu
https://arxiv.org/abs/2509.22239 https://arx…

Permutation closure for multiple context-free languages
We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure under \emph{cyclic shift}, and complements work of Brandstädt [1981, RAIRO Inform. Théor.] (resp. Brough \emph{et al.} [2016, Discrete Math. Theor. Comput. Sci.]) who showed the same result for regular, context-sensitive, recursively enumerable (resp. EDT0L and ET0L) languages. In contrast to Okhotin and Sorokin who…

It's All About In-Context Learning! Teaching Extremely Low-Resource Languages to LLMs
Yue Li, Zhixue Zhao, Carolina Scarton
https://arxiv.org/abs/2508.19089 https://

It's All About In-Context Learning! Teaching Extremely Low-Resource Languages to LLMs
Extremely low-resource languages, especially those written in rare scripts, as shown in Figure 1, remain largely unsupported by large language models (LLMs). This is due in part to compounding factors such as the lack of training data. This paper delivers the first comprehensive analysis of whether LLMs can acquire such languages purely via in-context learning (ICL), with or without auxiliary alignment signals, and how these methods compare to parameter-efficient fine-tuning (PEFT). We systemat…

chDzDT: Word-level morphology-aware language model for Algerian social media text
Abdelkrime Aries
https://arxiv.org/abs/2509.01772 https://arxiv.org/pdf/2…

chDzDT: Word-level morphology-aware language model for Algerian social media text
Pre-trained language models (PLMs) have substantially advanced natural language processing by providing context-sensitive text representations. However, the Algerian dialect remains under-represented, with few dedicated models available. Processing this dialect is challenging due to its complex morphology, frequent code-switching, multiple scripts, and strong lexical influences from other languages. These characteristics complicate tokenization and reduce the effectiveness of conventional word-…

Macro-embedding Compiler Intermediate Languages in Racket
William J. Bowman
https://arxiv.org/abs/2509.19607 https://arxiv.org/pdf/2509.19607

Macro-embedding Compiler Intermediate Languages in Racket
We present the design and implementation of a macro-embedding of a family of compiler intermediate languages, from a Scheme-like language to x86-64, into Racket. This embedding is used as part of a testing framework for a compilers course to derive interpreters for all the intermediate languages. The embedding implements features including safe, functional abstractions as well as unsafe assembly features, and the interactions between the two at various intermediate stages. This paper aims to …

LLM-Based Multi-Task Bangla Hate Speech Detection: Type, Severity, and Target
Md Arid Hasan, Firoj Alam, Md Fahad Hossain, Usman Naseem, Syed Ishtiaque Ahmed
https://arxiv.org/abs/2510.01995

LLM-Based Multi-Task Bangla Hate Speech Detection: Type, Severity, and Target
Online social media platforms are central to everyday communication and information seeking. While these platforms serve positive purposes, they also provide fertile ground for the spread of hate speech, offensive language, and bullying content targeting individuals, organizations, and communities. Such content undermines safety, participation, and equity online. Reliable detection systems are therefore needed, especially for low-resource languages where moderation tools are limited. In Bangla,…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Time for Timed Monitorability
Thomas M. Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann

The role of synthetic data in Multilingual, Multi-cultural AI systems: Lessons from Indic Languages
Pranjal A. Chitale, Varun Gumma, Sanchit Ahuja, Prashant Kodali, Manan Uppadhyay, Deepthi Sudharsan, Sunayana Sitaram
https://arxiv.org/abs/2509.21294

The role of synthetic data in Multilingual, Multi-cultural AI systems: Lessons from Indic Languages
Developing AI systems that operate effectively across languages while remaining culturally grounded is a long-standing challenge, particularly in low-resource settings. Synthetic data provides a promising avenue, yet its effectiveness in multilingual and multicultural contexts remains underexplored. We investigate the creation and impact of synthetic, culturally contextualized datasets for Indian languages through a bottom-up generation strategy that prompts large open-source LLMs (>= 235B para…

[2025-10-02 Thu (UTC), 2 new articles found for cs.PL Programming Languages]
toXiv_bot_toot

[2025-09-02 Tue (UTC), no new articles found for cs.PL Programming Languages]
toXiv_bot_toot

CorIL: Towards Enriching Indian Language to Indian Language Parallel Corpora and Machine Translation Systems
Soham Bhattacharjee, Mukund K Roy, Yathish Poojary, Bhargav Dave, Mihir Raj, Vandan Mujadia, Baban Gain, Pruthwik Mishra, Arafat Ahsan, Parameswari Krishnamurthy, Ashwath Rao, Gurpreet Singh Josan, Preeti Dubey, Aadil Amin Kak, Anna Rao Kulkarni, Narendra VG, Sunita Arora, Rakesh Balbantray, Prasenjit Majumdar, Karunesh K Arora, Asif Ekbal, Dipti Mishra Sharma

CorIL: Towards Enriching Indian Language to Indian Language Parallel Corpora and Machine Translation Systems
India's linguistic landscape is one of the most diverse in the world, comprising over 120 major languages and approximately 1,600 additional languages, with 22 officially recognized as scheduled languages in the Indian Constitution. Despite recent progress in multilingual neural machine translation (NMT), high-quality parallel corpora for Indian languages remain scarce, especially across varied domains. In this paper, we introduce a large-scale, high-quality annotated parallel corpus covering 1…

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Complete the Cycle: Reachability Types with Expressive Cyclic References (Extended Version)
Haotian Deng, Siyuan He, Songlin Jia, Yuyan Bao, Tiark Rompf

Crosslisted article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- The WASM Cloak: Evaluating Browser Fingerprinting Defenses Under WebAssembly based Obfuscation
Sakib, Bin Akram, Spracklen, Kalutarage, Wijewickrama, Bilogrevic, Jadliwala

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
Katsuhiko Hayashi, Hidetaka Kamigaito
https://arxiv.org/abs/2509.22598 https://…

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments confirm perfect separability under noise-free conditions, while real-data experiments on English morphology show that learned features align with well-known linguistic constraints. These results demonstrate that the subregular hierarchy provides a rigorous an…