57 search results - page 9 / 12 » A Monadic Formalization of ML5 |
RTA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
PODS
1999
ACM
14 years 25 days ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
DIAGRAMS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...