Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
The semantic web vision will facilitate automation of many tasks, including the location and dynamic reconfiguration of web services. In this article, we are concerned with a speci...
Marco Alberti, Federico Chesani, Marco Gavanelli, ...
Abstract--This paper considers the discovery of trading decision models from high-frequency foreign exchange (FX) markets data using genetic programming (GP). It presents a domain-...
Siddhartha Bhattacharyya, Olivier V. Pictet, Gille...
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...