Sciweavers

1671 search results - page 201 / 335
» Language Constructs for Multi-agent Programming
Sort
View
POPL
2004
ACM
16 years 6 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
UM
2007
Springer
16 years 14 days ago
Mobile Opportunistic Planning: Methods and Models
Abstract. We present a study exploring the promise of developing computational systems to support the discovery and execution of opportunistic activities in mobile settings. We int...
Eric Horvitz, Paul Koch, Muru Subramani
HCW
1998
IEEE
15 years 10 months ago
Steps Toward Understanding Performance in Java
Java's design goals of portability, safety, and ubiquity make it a potentially ideal language for large-scale heterogeneous computing. One of the remaining challenges is to c...
Doug Lea
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 6 months ago
A computer verified, monadic, functional implementation of the integral
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
Russell O'Connor, Bas Spitters
IPL
2006
93views more  IPL 2006»
15 years 6 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso