Sciweavers

1948 search results - page 362 / 390
» Formalizing Mirror Theory
Sort
View
POPL
2010
ACM
14 years 7 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
POPL
2010
ACM
14 years 7 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 4 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
ICRA
2009
IEEE
151views Robotics» more  ICRA 2009»
14 years 4 months ago
Probabilistic estimation of Multi-Level terrain maps
— Recent research has shown that robots can model their world with Multi-Level (ML) surface maps, which utilize ‘patches’ in a 2D grid space to represent various environment ...
Cesar Rivadeneyra, Isaac Miller, Jonathan R. Schoe...
LICS
2009
IEEE
14 years 4 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram