Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
The definition of the next generation of wireless networks is well under way within the IEEE 802.11 High Throughput Task Group committee. The resulting standard, to be called IEEE...
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...