Hasil untuk "Germanic languages. Scandinavian languages"

Nguyet-Anh H. Lang, Eric Lang, Thanh Le-Cong et al.

Functional programming provides strong foundations for developing reliable and secure software systems, yet its adoption remains not widespread due to the steep learning curve. Recent advances in Large Language Models (LLMs) for code generation present new opportunities to lower these barriers. However, extensive evaluations of LLMs largely focus on imperative programming languages, and their capabilities in functional programming languages (FP) remain underexplored. To address this gap, we introduce FPEval, a holistic evaluation framework built on FPBench, a new benchmark of 721 programming tasks across three difficulty levels on three mainstream FP languages: Haskell, Ocaml and Scala. FPEval provides compehensive evaluation infrastructures with both test validations with comprehensive test suites and static analysis tools to assess both functional correctness and code style and maintainability. Using this framework, we evaluate state-of-the-art LLMs, including GPT-3.5, GPT-4o, and GPT-5, for code generation in functional programming languages and Java as an imperative baseline. Our results demonstrate that LLM performance in functional programming improves substantially with model advancement; however, error rates remain significantly higher in purely functional languages (Haskell and OCaml) than in hybrid (Scala) or imperative (Java) languages. Moreover, LLMs frequently generate non-idiomatic functional code that follows imperative patterns, raising concerns about code style and long-term maintainability. Finally, we show that LLMs can partially self-repair both correctness and quality issues when provided with static analysis feedback and hand-crafted instructions for common types of issues.

Alena Rezvukhina

Timo Rouget

In Videospielen tauchen Spieler:innen in vielfältige idyllische Welten ein, die eine facettenreiche Palette an Erfahrungen bieten. Der Beitrag zeigt zunächst auf, wie der Begriff der Idylle definiert werden kann und auf welche Weise Videospiele Idyllen entwerfen. Anschließend steht die Frage im Mittelpunkt, welche Kompetenzen im Umgang mit Computerspiel-Idyllen im Literaturunterricht erworben werden können. Im Rückgriff auf Matthis Kepsers Kompetenzmodell zur Computerspielbildung werden an zwei Beispielen die produktiven didaktischen Anknüpfungspunkte an idyllische Szenen und Spiele vorgeführt: zum einen anhand der Anfangsidylle des Mittelalter-Rollenspiels Kingdom Come: Deliverance, zum anderen durch eine Fokussierung auf das Genre cozy games, für das sich exemplarisch auf Journey konzentriert wird. Zu den zu erreichenden Kompetenzen zählen dabei Kenntnisse über die Medienästhetik von Computergames, narrative Kompetenzen, Interpretationsfähigkeit, politische Werturteile und nicht zuletzt ästhetische Erfahrungen.   Abstract (english): The poetry of pixels - a comfortable space for learners? Literature- and media-didactic potentials of idylls in video games In video games, players immerse themselves in a variety of idyllic worlds that offer a wide range of experiences. The article first shows how the term idyll can be defined and how video games create idylls. Afterwards it points out which skills can be acquired in dealing with computer game idylls in literature lessons. With reference to Matthis Kepser’s competence model for computer game education, the productive links to idyllic scenes and games are demonstrated using two examples: firstly, by using the initial idyll of the medieval role-playing game Kingdom Come: Deliverance. Secondly, by focusing on the cozy games genre, for which Journey is used as an example. The skills to be achieved include knowledge of the media aesthetics of computer games, narrative skills, interpretation skills, political value judgments and aesthetic experiences.

S. Mahmoud Mousawi, Sandra Zilles

In the context of learning formal languages, data about an unknown target language L is given in terms of a set of (word,label) pairs, where a binary label indicates whether or not the given word belongs to L. A (polynomial-size) characteristic set for L, with respect to a reference class L of languages, is a set of such pairs that satisfies certain conditions allowing a learning algorithm to (efficiently) identify L within L. In this paper, we introduce the notion of positive characteristic set, referring to characteristic sets of only positive examples. These are of importance in the context of learning from positive examples only. We study this notion for classes of relational pattern languages, which are of relevance to various applications in string processing.

Baudouin Le Charlier

I present the most fundamental features of an implemented system designed to manipulate representations of regular languages. The system is structured into two layers, allowing regular languages to be represented in an increasingly compact, efficient, and integrated way. Both layers are first presented at a high level, adequate to design and prove the correctness of abstract algorithms. Then, their low-level implementations are described meticulously. At the high level, the first layer offers a notion of normalized regular expressions ensuring that the set of all syntactic derivatives of an expression is finite. At the low level, normalized expressions are uniquely represented by identifiers, i.e. by standard integers. The second layer, called the background, introduces additional notions to record, integrate, and simplify things computed within the first layer. At the high level, normalized expressions denoting the same regular language can be unified by grouping them into equivalence classes. One shortest expression is chosen in each class as its representative, which can be used to form equations relating expressions to their derivatives. This paper also presents extensive experimental results to demonstrate the usefulness of the proposed framework and, in particular, the fact that it makes it possible to represent large sets of regular languages in a unified way where distinct identifiers designate different languages, represented by both a small expression and a minimal deteministic automaton.

Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki

The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(ΣΣ)^*$ has period two because the length of a recursion (cycle) in its DFA must be even. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period $P$ if and only if its syntactic monoid is isomorphic to a submonoid of a semidirect product between a specific finite monoid and the cyclic group of order $P$. Moreover, we explore the relation between the structure of Markov chains and our result, and apply this relation to the theory of probabilities of languages. We also discuss the Krohn-Rhodes decomposition of finite semigroups, which is strongly linked to our methods.

Oliver Blomqvist

Språkkontakten mellan lågtyska och de skandinaviska språken har under senaste årtiondens forskning till stor del diskuterats genom begreppen ackommodation och semikommunikation (passiv tvåspråkighet). I denna artikel studeras två senmedeltida svenska brevskrivare som uppvisar tydliga tecken på aktiv skandinavisk-lågtysk tvåspråkighet. Materialet består dels av sex handelsbrev från 1513–1515 skrivna av Stralsundsborgaren Olof Lorber till domprosten Påval Scheel i Åbo, dels av ett privatbrev daterat till 1511 från Nådendalsborgaren Olof Pedersson till klosterbrodern Mattias Olsson. Båda brev innehåller flerspråkiga inslag som inte kan ses som tecken på anpassning till mottagarens språk betingad av kommunikativ hänsyn: i Lorbers brev förekommer olika slags lågtyska interferensdrag i den i övrigt dansk-svenska texten, och Olof Pederssons svenska brev till den likaså svenske mottagaren Mattias Olsson innehåller betydliga inslag på lågtyska. Resultaten visar att nya perspektiv behövs för att förstå den senmedeltida språkkontakten mellan lågtyska och skandinaviska.

Posch Claudia

Vanja Ramos Vieira de Campos, Sérgio Antônio da Silva Leite

Este trabalho tem como objetivo analisar as práticas pedagógicas adotadas por  professores de língua alemã, de diversos estados do país, a partir das bases teóricas de Vigotski (2009 [1934]; 2018 [1926])e Wallon (1978 [1942]; 2010 [1941]), correlacionando-as às propostas de interações entre os sujeitos (aluno) e os diversos objetos de conhecimento (áreas e conteúdos escolares), no contexto da globalização. Dessa forma, abordamos a mediação do professor de alemão, levando em conta os elementos capazes de afetar positivamente o aluno e de promover sua aproximação e interesse pela língua alemã ou, ao contrário, o seu afastamento e aversão. A partir da aplicação de questionário elaborado com 11 questões fechadas, estabelecemos inferências a partir da correlação entre os registros e as possibilidades de afetar positivamente os alunos, no sentido de promover um movimento de aproximação dos alunos à língua alemã. Concluímos que o grupo de 85 docentes respondentes desenvolve práticas pedagógicas no ensino de alemão capazes de afetar positivamente seus alunos e, desse modo, alcançar resultados de sucesso. Destaca-se a abordagem de temas socioculturais associados às expectativas de desempenho linguístico e às implicações para a vida social do aluno.

Caleb Kim, Pai Li, Anshuman Mohan et al.

Compilers for accelerator design languages (ADLs) translate high-level languages into application-specific hardware. ADL compilers rely on a hardware control interface to compose hardware units. There are two choices: static control, which relies on cycle-level timing; or dynamic control, which uses explicit signalling to avoid depending on timing details. Static control is efficient but brittle; dynamic control incurs hardware costs to support compositional reasoning. Piezo is an ADL compiler that unifies static and dynamic control in a single intermediate language (IL). Its key insight is that the IL's static fragment is a refinement of its dynamic fragment: static code admits a subset of the run-time behaviors of the dynamic equivalent. Piezo can optimize code by combining facts from static and dynamic submodules, and it opportunistically converts code from dynamic to static control styles. We implement Piezo as an extension to an existing dynamic ADL compiler, Calyx. We use Piezo to implement an MLIR frontend, a systolic array generator, and a packet-scheduling hardware generator to demonstrate its optimizations and the static-dynamic interactions it enables.

Michael Schulte

Emnet for dette bidraget er to runeformler fra ulike tidsepoker. De er strukturelt nokså likt gjennomført ved enderim og “[v]ekslende initialer med faste repetisjoner” (Nordby 2018: 109). Den ene er den velkjente þistill-mistill-kistill-formelen, som først opptrer på den danske Gørlevsteinen rundt 800–850 e.Kr., den andre er den yngre horn-þorn-korn-formelen, som er ristet inn i kalkpuss i to gotlandske kirker og på en blyamulett fra Kællingeby. Denne type formler kobles gjerne til en opplæringskontekst, særlig horn-þorn-korn. Artikkelen argumenterer for en symbiose mellom hedenske og kristne allegorier som kommer til syne i ulike kontekster. Det argumenteres for en interaksjon mellom folkemagi og kristne bønner som tar i bruk både hedenske og kristne virkemidler. Den prototypiske vernefunksjonen av de to formlene kommer tydelig fram på amulettinnskrifter fra middelalderen, jf. þistill-mistill-kistill-formelen på Vedslet-sandsteinamuletten (DR 57) og horn-þorn-korn-formelen på Kællingeby-blyamuletten (DK Bh 20).

Mergenfel Vaz Ferreira, Gabriela Marques-Schäfer, Ebal Bolacio Filho

Das Hauptziel dieses Artikels ist es, einen Überblick über die Entstehung eines Lehrprojekts der Stadt Rio de Janeiro zur Förderung der Mehrsprachigkeit an öffentlichen Schulen zu geben. Zu diesem Zweck stützt sich der Artikel zunächst auf einige offizielle Dokumente – wie z.B. den Text des Nationalen Rahmenlehrplans (BNCC) und die Leitprinzipien für das Programm für zweisprachige Schulen in der Stadt Rio de Janeiro, die das Lehren von Fremdsprachen in Brasilien und in der Stadt Rio de Janeiro leiten. Darüber hinaus werden in diesem Beitrag Ergebnisse einer Studie vorgestellt, die mit den Lehrkräften durchgeführt wurde, die seit Beginn des Projekts als Deutschlehrende dort arbeiten. Die Ergebnisse der Studie zeigen, dass critical literacy und interkulturelles Lernen grundlegende Prinzipien sowohl in der Wahrnehmung als auch in der Praxis der Lehrenden sind. Schließlich zeigt der vorliegende Beitrag, wie wichtig diese Lehrprojekt zur Förderung einer reicheren und pluralen Bildung von Schüler*innen ist.

Simon Fowler, Vashti Galpin, James Cheney

Modern applications often manage time-varying data. Despite decades of research on temporal databases, which culminated in the addition of temporal data operations into the SQL:2011 standard, temporal data query and manipulation operations are unavailable in most mainstream database management systems, leaving developers with the unenviable task of implementing such functionality from scratch. In this paper, we extend \emph{language-integrated query} to support writing temporal queries and updates in a uniform host language, with the language performing the required rewriting to emulate temporal capabilities automatically on any standard relational database. We introduce two core languages, $λ_{\mathsf{TLINQ}}$ and $λ_{\mathsf{VLINQ}}$, for manipulating transaction time and valid time data respectively, and formalise existing implementation strategies by giving provably correct semantics-preserving translations into a non-temporal core language, $λ_{\mathsf{LINQ}}$. We show how existing work on query normalisation supports a surprisingly simple implementation strategy for \emph{sequenced joins}. We implement our approach in the Links programming language, and describe a non-trivial case study based on curating COVID-19 statistics.

P. Auer, Vanessa Siegel

While major restructurings and simplifications have been reported for gender systems of other Germanic languages in multiethnolectal speech, this article demonstrates that the three-way gender distinction of German is relatively stable among young speakers from an immigrant background. We investigate gender in a German multiethnolect based on a corpus of approximately 17 hours of spontaneous speech produced by 28 young speakers in Stuttgart (mainly from Turkish and Balkan background). German is not their second language, but (one of) their first language(s), which they have fully acquired from childhood. We show that the gender system does not show signs of reduction in the direction of a two-gender system, nor of wholesale loss. We also argue that the position of gender in the grammar is weakened by independent innovations, such as the frequent use of bare nouns in grammatical contexts where German requires a determiner. Another phenomenon that weakens the position of gender is the simplification of adjective-noun agreement and the emergence of a generalized gender-neutral suffix for prenominal adjectives (that is, schwa). The disappearance of gender and case marking in the adjective means that the grammatical category of gender is lost in Adj + N phrases (without a determiner).

Maurice Jamieson, Nick Brown

Micro-core architectures combine many simple, low memory, low power-consuming CPU cores onto a single chip. Potentially providing significant performance and low power consumption, this technology is not only of great interest in embedded, edge, and IoT uses, but also potentially as accelerators for data-center workloads. Due to the restricted nature of such CPUs, these architectures have traditionally been challenging to program, not least due to the very constrained amounts of memory (often around 32KB) and idiosyncrasies of the technology. However, more recently, dynamic languages such as Python have been ported to a number of micro-cores, but these are often delivered as interpreters which have an associated performance limitation. Targeting the four objectives of performance, unlimited code-size, portability between architectures, and maintaining the programmer productivity benefits of dynamic languages, the limited memory available means that classic techniques employed by dynamic language compilers, such as just-in-time (JIT), are simply not feasible. In this paper we describe the construction of a compilation approach for dynamic languages on micro-core architectures which aims to meet these four objectives, and use Python as a vehicle for exploring the application of this in replacing the existing micro-core interpreter. Our experiments focus on the metrics of performance, architecture portability, minimum memory size, and programmer productivity, comparing our approach against that of writing native C code. The outcome of this work is the identification of a series of techniques that are not only suitable for compiling Python code, but also applicable to a wide variety of dynamic languages on micro-cores.

Vikraman Choudhury, Jacek Karwowski, Amr Sabry

The $\mathitΠ$ family of reversible programming languages for boolean circuits is presented as a syntax of combinators witnessing type isomorphisms of algebraic datatypes. In this paper, we give a denotational semantics for this language, using the language of weak groupoids à la Homotopy Type Theory, and show how to derive an equational theory for it, presented by 2-combinators witnessing equivalences of reversible circuits. We establish a correspondence between the syntactic groupoid of the language and a formally presented univalent subuniverse of finite types. The correspondence relates 1-combinators to 1-paths, and 2-combinators to 2-paths in the universe, which is shown to be sound and complete for both levels, establishing full abstraction and adequacy. We extend the already established Curry-Howard correspondence for $\mathitΠ$ to a Curry-Howard-Lambek correspondence between Reversible Logic, Reversible Programming Languages, and Symmetric Rig Groupoids, by showing that the syntax of $\mathitΠ$ is presented by the free symmetric rig groupoid, given by finite sets and permutations. Our proof uses techniques from the theory of group presentations and rewriting systems to solve the word problem for symmetric groups. Using the formalisation of our results, we show how to perform normalisation-by-evaluation, verification, and synthesis of reversible logic gates, motivated by examples from quantum computing.

Leon Derczynski, R. Baglini, Morten H. Christiansen et al.

Leonard Neidorf, Rafael J. Pascual

This article undertakes the first systematic examination of Frank’s (1979, 1981, 1987, 1990, 2007b, 2008) claim that Old Norse influence is discernible in the language of Beowulf. It tests this hypothesis first by scrutinizing each of the alleged Nordicisms in Beowulf, then by discussing various theoretical considerations bearing on its plausibility. We demonstrate that the syntactic, morphological, lexical, and semantic peculiarities that Frank would explain as manifestations of Old Norse influence are more economically and holistically explained as consequences of archaic composition. We then demonstrate that advances in the study of Anglo-Scandinavian language contact provide strong reasons to doubt that Old Norse could have influenced Beowulf in the manner that Frank has proposed. We conclude that Beowulf is entirely devoid of Old Norse influence and that it was probably composed ca. 700, long before the onset of the Viking Age.

Vanessa González Ribao

The Lexicographic Treatment of Neologisms from the Perspective of Hispanophone Learners of GFL.On the basis of some instrumental verbs of communication such as mailen (to mail) or twittern (to tweet) we examined the lexicological information offered on neologisms for its adequacy for text production in a foreign language. The study is carried out from the perspective of a Hispanophone learner of GFL. We analyzed neologism dictionaries and databases for German as well as bilingual online dictionaries for Spanish–German. We compared the results of the lexicographic investigation with corpus-based data from a doctoral thesis. The findings point out the need and necessity of improving the treatment of (verbal) neologisms in Spanish–German dictionaries. When doing so the text production in a foreign language should be particularly considered.

Mojmír Jeřábek