Sciweavers

1458 search results - page 19 / 292
» Monads for incremental computing
Sort
View
CL
2012
Springer
12 years 8 days ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...
PEPM
2000
ACM
14 years 1 months ago
From Recursion to Iteration: What are the Optimizations?
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
Yanhong A. Liu, Scott D. Stoller
NDJFL
2010
13 years 4 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
MFCS
2009
Springer
14 years 4 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
P. Madhusudan, Mahesh Viswanathan
HASKELL
2008
ACM
13 years 11 months ago
A library for light-weight information-flow security in haskell
Protecting confidentiality of data has become increasingly important for computing systems. Information-flow techniques have been developed over the years to achieve that purpos...
Alejandro Russo, Koen Claessen, John Hughes