ENTCS
2002
13 years 4 months ago
2002
ENTCS
2002
13 years 4 months ago
2002
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
ENTCS
2002
13 years 4 months ago
2002
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
ENTCS
2002
13 years 4 months ago
2002
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
ENTCS
2002
13 years 4 months ago
2002
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
ENTCS
2002
13 years 4 months ago
2002
ENTCS
2002
13 years 4 months ago
2002
Every endofunctor F of Set has an initial algebra and a final coalgebra, but they are classes in general. Consequently, the endofunctor F of the category of classes that F induces...
ENTCS
2002
13 years 4 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
ENTCS
2002
13 years 4 months ago
2002
Component-oriented software development is becoming more and more important for the production of large-scale software applications. Today's systems are constructed by combin...
ENTCS
2002
13 years 4 months ago
2002