Sciweavers

1264 search results - page 153 / 253
» Abstract machines for programming language implementation
Sort
View
SOFSEM
2009
Springer
14 years 5 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
ATAL
2003
Springer
14 years 1 months ago
Autonomy and Agent Deliberation
Abstract. An important aspect of agent autonomy is the decision making capability of the agents. We discuss several issues that agents need to deliberate about in order to decide w...
Mehdi Dastani, Frank Dignum, John-Jules Ch. Meyer
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 1 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
PADL
1999
Springer
14 years 14 days ago
Or-Parallelism within Tabling
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
HPCA
1995
IEEE
13 years 11 months ago
Software Cache Coherence for Large Scale Multiprocessors
Shared memory is an appealing abstraction for parallel programming. It must be implemented with caches in order toperform well, however, and caches require a coherence mechanism t...
Leonidas I. Kontothanassis, Michael L. Scott