This paper describes Gammall og, a logic language based on multiset rewriting. The language combines the ability of describing parallel programs made of multiset transformation rules as in GAMMA with the execution model of logic programming in a strongly typed framework as in GG odel. We describe the design choices, the syntax and the semantics of the language, and a prototype implementation.

We describe the core of a new strongly-typed functional programming language called LEAP, a \Language with Eval And Polymorphism." Pure LEAP is an extension of the !-order polymorphic -calculus (F ! ) by global de nitions that allows the representation of programs and the de nition of versions of reify, reflect, and eval for all of F ! . Pure LEAP is therefore highly re exive and strongly typed...

The paper describes a novel rule-based approach to classification of opinion statements on the level of individual sentences. In contrast to existing approaches, the proposed method relies on the rules elaborated for semantically distinct verb classes. To deeply analyse the type, strength, and confidence level of expressed opinion, the system relies on the compositionality principle and lexicon...

We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructible in deterministic polynomial time) Boolean function , over the basis U2. That is, we obtain a lower bound of 5n−o(n) for the number of {and, or} gates needed to compute a certain Boolean function, over the basis {and, or, not} (where the not gates are not counted). Our proof is based on a new combinatori...

We study the approachability ideal I[κ+] in the context of large cardinals and properties of the regular cardinals below a singular κ. As a guiding example consider the approachability ideal I[אω+1] assuming that אω is a strong limit. In this case we obtain that club many points in אω+1 of cofinality אn for some n > 1 are approachable assuming the joint reflection of countable families of stati...

Genetic Programming is increasing in popularity as the basis for a wide range of learning algorithms. However, the technique has to date only been successfully applied to modest tasks because of the performance overheads of evolving a large number of data structures, many of which do not correspond to a valid program. We address this problem directly and demonstrate how the evolutionary process...

We integrate existential types into a strongly typed C-like language. In particular, we show how a bad combination of existential types, mutation, and aliasing can cause a subtle violation of type safety. We explore two independent ways to strengthen the type system to restore safety. One restricts the mutation of existential packages. The other restricts the types of aliases of existential pac...

Fortran is still a very dominant language for scientific computations. However it lacks modern language features like strong typing, object orientation, and other design features of modern programming languages. Therefore, among scientists there is an increasing interest in object oriented languages like Java. In this paper, we will discuss a number of prospects and problems in Java for scienti...

Providing an appropriate level of accessibility and traceability to data or process elements (‘Items’) in large volumes of data, often Cloud-resident, is an essential requirement in the Big Data era. Enterprise-wide data systems need to be designed from the outset to support usage of such Items across the spectrum of business use rather than from any specific application view. The design philos...

Giving a complete semantics to strongly typed object-oriented programming is a well-known research problem. Recent work has made signiicant strides toward solving this problem. However , in most of this work a purely functional, call-by-name view of objects is taken. In this paper we give meaning to a call-by-value, typed object language with updatable instance variables , and prove the type sy...