57 search results - page 11 / 12 » A Monadic Formalization of ML5 |
149
Voted
EACL
2006
ACL Anthology
15 years 5 months ago
2006
ACL Anthology
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
126
Voted
HASKELL
2006
ACM
15 years 9 months ago
2006
ACM
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...
143
Voted
ICFP
2008
ACM
16 years 3 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...
119
Voted
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
166
Voted
HASKELL
2009
ACM
15 years 10 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...