1912 search results - page 218 / 383 » On the evaluation of argumentation formalisms |
160
click to vote
IFL
2001
Springer
15 years 11 months ago
2001
Springer
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
167
click to vote
IFL
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
174
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
186
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
158
click to vote
IFL
1997
Springer
15 years 10 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...