A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically the shortest Haskell program using the set of function components (or library) configured beforehand, and there is n...

infer XML Schema from provided XML data file, by reverse engineering (if you can't obtain the original XSD definition from the data provider). Some options. To create one, you need to have an XML schema file (.xsd) and an XML data file (.xml). but does support the child tags and attributes defined in that complex type. For an XML data file, Excel will try to infer the XML schema from the XML. X...

This paper describes an approach to capturing the relation between circuits and their behaviours within a formal theory. The method exploits dependent types to achieve a rigorous yet theoretically simple connection between circuits (treated as graphs) and their behavioural speciications (treated as predicates). An example is given of a behavioural extraction function and it is shown how a type ...

The modeling and simulation of physical systems is of key importance in many areas of science and engineering, and thus can benefit from high-quality software tools. In previous research we have demonstrated how functional programming can form the basis of an expressive language for causal hybrid modeling and simulation. There is a growing realization, however, that a move toward non-causal mod...

In this paper, we propose a relaxation-labeling algorithm for real-time contour-based image similarity retrieval that treats the matching between two images as a consistent labeling problem. To satisfy real-time response, our algorithm works by reducing the size of the labeling problem, thus decreasing the processing required. This is accomplished by adding compatibility constraints on contour ...

We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that are well suited to the representation of heterogeneous data, irrespective of whether the data originated from relational, unstructured, semi-structured or structured sources. This higher-order generalisation of the relational model has potential applications in NoSQL databases and Big Variety, Big ...

Adaptive data is characterised by its ability to react to changes in the environment. Such data frequently occurs in Artificial Intelligence applications where the knowledge base may alter dynamically to adapt to new stimuli. Such systems are usually written in typeless, dynamically bound languages. Here we describe the concept of persistence and show how it may also be used in conjunction with...

We present MTMJ, a multithreaded middleweight model language for Java which is strongly typed and prevents multiple run-time start of threads. The key point in designing the language is to balance precision and efficiency by judicious utilization of context information during type checking. While the types are flow-insensitive, the required flowdependent information is collected as type checkin...

Objective ML is a small practical extension to ML with objects and top level classes. It is fully compatible with ML; its type system is based on ML polymorphism, record types with polymorphic access, and a better treatment of type abbreviations. Objective ML allows for most features of object-oriented languages including multiple inheritance, methods returning self and binary methods as well a...

A fundamental distinction between goods and services is that in the retailing of goods and some services the costs of production and distribution are clearly separable in a non-arbitrary fashion, usually identified as costs of goods sold. They have type I separability. Distribution services, which are also known as attributes, marketing mix or output variables, are produced, distributed and con...