ENTCS
2002
13 years 11 months ago
2002
This paper presents a new lambda-calculus with singleton types, called {}. The main novelty of
ENTCS
2002
13 years 11 months ago
2002
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...
ENTCS
2002
13 years 11 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
ENTCS
2002
13 years 11 months ago
2002
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
ENTCS
2002
13 years 11 months ago
2002
ENTCS
2002
13 years 11 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
ENTCS
2002
13 years 11 months ago
2002
ENTCS
2002
13 years 11 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
ENTCS
2002
13 years 11 months ago
2002
Declarative debugging has been proposed as a suitable technique for developing debuggers in the context of declarative languages. However, to become really useful debuggers must b...
ENTCS
2002
13 years 11 months ago
2002
