4757 search results - page 9 / 952 » Monads for Functional Programming |
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
Functional reactive programming (FRP) has simple and powerful semantics, but has resisted efficient implementation. In particular, most past implementations have used demand-driv...
APLAS
2008
ACM
13 years 9 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
SLOGICA
2008
13 years 6 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
HASKELL
2005
ACM
14 years 1 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.