Sciweavers

4757 search results - page 11 / 952
» Monads for Functional Programming
Sort
View
POPL
2008
ACM
14 years 7 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
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...
Nils Anders Danielsson
ESOP
2000
Springer
13 years 11 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
ICALP
2007
Springer
14 years 1 months ago
Boundedness of Monadic FO over Acyclic Structures
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
ICFP
2005
ACM
14 years 7 months ago
A principled approach to operating system construction in Haskell
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
Thomas Hallgren, Mark P. Jones, Rebekah Leslie, An...
LICS
2003
IEEE
14 years 24 days ago
Spectra of Monadic Second-Order Formulas with One Unary Function
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one fu...
Yuri Gurevich, Saharon Shelah