We show that the traditional notion of superposition as used for supporting parallel program design can subsume both composition and refinement relationships when non-deterministi...
Metaprogramming is a generic approach described in many articles. Surprisingly, examples of successful applications are scarce. This paper gives such an example. With a metaprogra...
Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophica...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Modularity and tool support are crucial features for practical use of formal descriptions of programming languages. The combination of unrestricted context-free grammars with acti...