Sciweavers

1247 search results - page 103 / 250
» Reasoning about Function Objects
Sort
View
PEPM
2011
ACM
14 years 25 days ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
ICIP
2009
IEEE
15 years 11 months ago
Lidar Waveform Modeling Using A Marked Point Process
Lidar waveforms are 1D signal consisting of a train of echoes where each of them correspond to a scattering target of the Earth surface. Modeling these echoes with the appropriate...
FSTTCS
2006
Springer
15 years 1 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...
IWFM
2003
123views Formal Methods» more  IWFM 2003»
14 years 11 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
ENTCS
2008
102views more  ENTCS 2008»
14 years 10 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin