Sciweavers

4757 search results - page 25 / 952
» Monads for Functional Programming
Sort
View
GPCE
2007
Springer
14 years 1 months ago
Constructing language processors with algebra combinators
Modular Monadic Semantics (MMS) is a well-known mechanism for structuring modular denotational semantic definitions for programming languages. The principal attraction of MMS is ...
Philip Weaver, Garrin Kimmell, Nicolas Frisby, Per...
JACM
2002
122views more  JACM 2002»
13 years 7 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
HASKELL
2006
ACM
14 years 1 months ago
Running the manual: an approach to high-assurance microkernel development
We propose a development methodology for designing and prototyping high assurance microkernels, and describe our application of it. The methodology is based on rapid prototyping a...
Philip Derrin, Kevin Elphinstone, Gerwin Klein, Da...
IANDC
2008
95views more  IANDC 2008»
13 years 7 months ago
Comparing communication primitives via their relative expressive power
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
Daniele Gorla
VMCAI
2010
Springer
14 years 4 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...