233 search results - page 46 / 47 » Computational Lambda-Calculus and Monads |
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...