Sciweavers

4757 search results - page 13 / 952
» Monads for Functional Programming
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
GenI: natural language generation in Haskell
In this article we present GenI, a chart based surface realisation tool implemented in Haskell. GenI takes as input a set of first order terms (the input semantics) and a grammar...
Eric Kow
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
13 years 7 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
CSFW
2005
IEEE
14 years 1 months ago
Achieving Information Flow Security through Precise Control of Effects
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
William L. Harrison, James Hook
LOPSTR
2009
Springer
14 years 2 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
CTCS
1997
Springer
13 years 11 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani