172 search results - page 19 / 35 » Structure and Properties of Traces for Functional Programs |
132
click to vote
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
108
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we propose a testing based method for safety/ reachability analysis of stochastic hybrid systems. Testing based methods are characterized by analysis based on the...
160
Voted
PEPM
2011
ACM
14 years 6 months ago
2011
ACM
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...
265
Voted
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
118
Voted
ICFP
2001
ACM
16 years 3 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...