Sciweavers

480 search results - page 19 / 96
» Continuations for parallel logic programming
Sort
View
FLOPS
2004
Springer
15 years 8 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
132
Voted
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 6 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
111
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 3 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
104
Voted
IPPS
1997
IEEE
15 years 7 months ago
Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
Gopal Gupta, Enrico Pontelli
132
Voted
TLCA
2007
Springer
15 years 8 months ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan