Sciweavers

10048 search results - page 134 / 2010
» The Structure and Performance of Interpreters
Sort
View
PDP
2003
IEEE
14 years 2 months ago
An XML based framework for self-describing parallel I/O data
File I/O data is interpreted by high performance parallel/distributed applications mostly as a sequence of arbitrary bits. This leads to the situation where data is ’volatile’...
András Belokosztolszki, Erich Schikuta
MOBISYS
2011
ACM
13 years 5 days ago
Odessa: enabling interactive perception applications on mobile devices
Resource constrained mobile devices need to leverage computation on nearby servers to run responsive applications that recognize objects, people, or gestures from real-time video....
Moo-Ryong Ra, Anmol Sheth, Lily B. Mummert, Padman...
POPL
2012
ACM
12 years 4 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
ENTCS
2002
114views more  ENTCS 2002»
13 years 9 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
IANDC
2010
125views more  IANDC 2010»
13 years 7 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat