practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

A Note of Zipf's Law, Natural Languages, and Noncoding DNA Regions

In Phys. Rev. Letters (73:2), Mantegna et al. conclude on the basis of Zipf rank frequency data that noncoding DNA sequence regions are more like natural languages than coding regions. We argue on the contrary that an empirical fit to Zipf"s "law" cannot be used as a criterion for similarity to natural languages. Although DNA is a presumably "organized system of signs" in Mandelbrot"s (1961) sense, and observation of statistical featurs of the sort presented in the Mantegna et al. paper does not shed light on the similarity between DNA's "gramar" and natural language grammars, just as the observation of exact Zipf-like behavior cannot distinguish between the underlying processes of tossing an M-sided die or a finite-state branching process.

Supporting Dynamic Languages on the Java Virtual Machine

In this note, I propose two extensions to the Java virtual machine (or VM) to allow dynamic languages such as Dylan, Scheme and Smalltalk to be efficiently implemented on the VM. These extensions do not affect the performance of pure Java programs on the machine. The first extension allows for efficient encoding of dynamic data; the second allows for efficient encoding of language-specific computational elements.

Estrutura básica do MicroArray Gene Expression Markup Language - MAGE-ML.

Um dos objetivos da Rede Genômica Animal é a identificação de genes que contribuam para o melhoramento de características de interesse econômico em animais de produção. Uma das ferramentas para prospecção e análise desses genes é o Microarranjo de DNA, uma técnica que permite avaliar a expressão gênica em condições específicas. Apesar de seu uso amplamente difundido na comunidade científica, os procedimentos e as informações de experimentos nem sempre são padronizados, a despeito dos esforços na criação de uma linguagem padrão como o MAGE-ML. Este documento visa apresentar o padrão MAGE-ML para aqueles que ainda não se utilizam desse recurso e gostariam de aprender um pouco a respeito.

Studies on Celtic Languages before the Year 1000

Sims-Williams, Patrick, Studies on Celtic Languages before the Year 1000 (Aberystwyth, CMCS Publications, 2007) RAE2008

StaXML: Static Typing of XML Document Fragments for Imperative Web Scripting Languages

We present a type system, StaXML, which employs the stacked type syntax to represent essential aspects of the potential roles of XML fragments to the structure of complete XML documents. The simplest application of this system is to enforce well-formedness upon the construction of XML documents without requiring the use of templates or balanced "gap plugging" operators; this allows it to be applied to programs written according to common imperative web scripting idioms, particularly the echoing of unbalanced XML fragments to an output buffer. The system can be extended to verify particular XML applications such as XHTML and identifying individual XML tags constructed from their lexical components. We also present StaXML for PHP, a prototype precompiler for the PHP4 scripting language which infers StaXML types for expressions without assistance from the programmer.

Internal languages of retrieval: the bilingual encoding of memories for the personal past.

In contrast to most research on bilingual memory that focuses on how words in either lexicon are mapped onto memory for objects and concepts, we focus on memory for events in the personal past. Using a word-cue technique in sessions devoted exclusively to one language, we found that older Hispanic immigrants who had come to the United States as adults internally retrieved autobiographical memories in Spanish for events in the country of origin and in English for events in the U.S. These participants were consistently capable of discerning whether a memory had come to them "in words" or not, reflecting the distinction between purely imagistic or conceptual memories and specifically linguistic memories. Via examination of other phenomenological features of these memories (sense of re-living, sensory detail, emotionality, and rehearsal), we conclude that the linguistic/nonlinguistic distinction is fundamental and independent of these other characteristics. Bilinguals encode and retrieve certain autobiographical memories in one or the other language according to the context of encoding, and these linguistic characteristics are stable properties of those memories over time.

Celtic languages in European Higher Education: CRAMLAP - Celtic, Regional and Minority Languages Abroad Project

The Celtic, Regional and Minority Languages Abroad
Project (CRAMLAP) is funded by the European Commission
to research the provision and pedagogy of regional
and minority languages outside their national borders in
Europe. The teaching of Celtic languages across Europe
was the focus in year one (2003-2004). This article summarizes
the qualitative data received in response to
questionnaires sent to institutions across Europe offering
Celtic Studies. Responses indicated that Celtic Studies
are quite widely available across Europe. The languages
are taught in comparative linguistics, linguistics and English
departments, with few dedicated Celtic departments
or sections outside the Celtic countries. Irish is supported
abroad by Irish government grant aid which will
become more widely available in the immediate future.
Many of the teachers have considerable experience, but
limited pedagogic training. The lack of suitable teaching
resources is the most commonly expressed concern.

Zipf and Type-Token rules for the English, Spanish, Irish and Latin languages

The Zipf curves of log of frequency against log of rank for a large English corpus of 500 million word tokens, 689,000 word types and for a large Spanish corpus of 16 million word tokens, 139,000 word types are shown to have the usual slope close to –1 for rank less than 5,000, but then for a higher rank they turn to give a slope close to –2. This is apparently mainly due to foreign words and place names. Other Zipf curves for highlyinflected Indo-European languages, Irish and ancient Latin, are also given. Because of the larger number of word types per lemma, they remain flatter than the English curve maintaining a slope of –1 until turning points of about ranks 30,000 for Irish and 10,000 for Latin. A formula which calculates the number of tokens given the number of types is derived in terms of the rank at the turning point, 5,000 for both English and Spanish, 30,000 for Irish and 10,000 for Latin.