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

This paper presents a dynamic strategy for monitoring the depth of program trees evolved by STEPS (Strongly Typed Evolutionary Programming System). STEPS evolves higher-order functional programs in the form of trees, which are allowed to grow or shrink to fit the size of the problem, via specialised genetic operators. Thus, the need for arbitrary cut-off mechanisms is eliminated.

This paper demonstrates how strongly-typed genetic programming may be used to evolve valid teleo-reactive programs that solve the general block-stacking problem using indexicals.

Explicit substitution calculi are extensions of the -calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming languages and proof assistant systems. In this paper we explore new developments on two of the most successful styles of explicit substitution c...

Can there be a database programming language with a type system that matches the data model? Can such a language be strongly typed? Can it be statically typed? A static type system for database programming languages is, of course, the Holy Grail of the subject. However we, the authors, who have spent some effort in searching for this venerated object, now doubt its existence and have come to be...

Amemory-enabled program representation in strongly-typed Genetic Programming (GP) is compared against the standard representation in a number of financial time-series modelling tasks. The paper first presents a survey of GP systems that utilise memory. Thereafter, a number of simulations show thatmemory-enabled programs generalise better than their standard counterparts in most datasets of this...