Sciweavers

3053 search results - page 137 / 611
» A Logic of Abstract Argumentation
Sort
View
ECOOP
2006
Springer
15 years 10 months ago
Parameterized Modules for Classes and Extensible Functions
Abstract. We present F(Eml), a language that combines classes, extensible functions, symmetric multiple dispatching, and a practical system for parameterized modules. Parameterized...
Keunwoo Lee, Craig Chambers
POPL
1995
ACM
15 years 10 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy
CSL
2008
Springer
15 years 8 months ago
The Computability Path Ordering: The End of a Quest
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Frédéric Blanqui, Jean-Pierre Jouann...
DT
2006
113views more  DT 2006»
15 years 6 months ago
The Challenges of Synthesizing Hardware from C-Like Languages
at their abstractions are similar to data types and operations supplied by conventional processors. A core principle of BCPL is its memory model: an The Challenges of Synthesizing ...
Stephen A. Edwards
PPSN
2010
Springer
15 years 5 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt