ENTCS
2008
13 years 5 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
ENTCS
2008
13 years 5 months ago
2008
The modularity of programming language descriptions allows the designer to describe each programming language feature in a separated module that can be studied independently of ot...
ENTCS
2008
13 years 5 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
ENTCS
2008
13 years 5 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
ENTCS
2008
13 years 5 months ago
2008
ENTCS
2008
13 years 5 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
ENTCS
2008
13 years 5 months ago
2008
ENTCS
2008
13 years 5 months ago
2008
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
ENTCS
2008
13 years 5 months ago
2008
In this paper we present the essential feature we have considered when designing a new language based on rules and strategies. Relying on the implementation of Tom, we explain how...
ENTCS
2008
13 years 5 months ago
2008
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...