As the potential of applying machine learning techniques to perplexing problems is realised, increasingly complex problems are being tackled, requiring intricate explanations to be induced. Escher is a functional logic language whose higher-order constructs allow arbitrarily complex observations to be captured and highly expressive generalisations to be conveyed. The work presented in this thes...

For the t → W+b decay mode, an intensity-ratio equivalence for two distinct Lorentzinvariant couplings is shown to be a consequence of symmetries of tWb-transformations. Explicit tWb-transformations, A+ = M ASM , P ASM , B ASM connect the four standard model’s (SM) helicity amplitudes, ASM (λW+, λb), and the amplitudes A+ (λW+ , λb) in the case of an additional chiral-tensorial-coupling of rela...

Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on par...

In applied game theory the modelling of each player’s intentions and motivations is a key aspect. In classical game theory these are encoded in the payoff functions. In previous work [2,4] a novel way of modelling games was introduced where players and their goals are more naturally described by a special class of higher-order functions called quantifiers. We refer to these as higher-order game...

In one-shot games, an analyst who knows the best response correspondence can only make limited inferences about the players’ payoffs. In repeated games with full monitoring, this is not true: we show that, under a weak condition, if the game is repeated sufficiently many times and players are sufficiently patient, the best response correspondence completely determines the payoffs (up to positiv...

We study entanglement distillability of bipartite mixed spin states under Wigner rotations induced by Lorentz transformations. We define weak and strong criteria for relativistic isoentangled and isodistillable states to characterize relative and invariant behavior of entanglement and distillability. We exemplify these criteria in the context of Werner states, where fully analytical methods can...

I present an explicit framework for weak phase transformations in complex crystals which is alternative to the one given by Ericksen (2001) and myself (2002b). This approach seems better suited to treat complex lattices with many atoms in the unit cell. As an example, we analyze the model of quartz in Pitteri (2002b) from the present point of view.

Organophosphorus compounds are important in organic chemistry. This review article covers emerging, powerful synthetic approaches to organophosphorus compounds by homolytic substitution at phosphorus with a carbon-centered radical. Phosphination reagents include diphosphines, chalcogenophosphines and stannylphosphines, which bear a weak P-heteroatom bond for homolysis. This article deals with t...

The higher-order pattern calculus supports patterns as inputs and outputs, just as higher-order functional languages support functions. The resulting pattern polymorphic functions take arguments for both patterns, which describe where the data is, and functions, which describe how to act on data. The calculus is strongly-typed and reduction is type-safe and confluent.

In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation...