Sciweavers

233 search results - page 31 / 47
» Computational Lambda-Calculus and Monads
Sort
View
ENTCS
2008
99views more  ENTCS 2008»
13 years 7 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
NDJFL
2010
13 years 2 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 2 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 8 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
GI
2009
Springer
14 years 3 days ago
Reinventing Haskell Backtracking
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
Sebastian Fischer