1805 search results - page 237 / 361 » Functional programming with structured graphs |
118
click to vote
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
APLAS
2005
ACM
15 years 7 months ago
2005
ACM
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
ICDAR
2003
IEEE
15 years 6 months ago
2003
IEEE
A novel strategy for the representation and manipulation of distributed documents, potentially complex and heterogeneous, is presented in this paper. The document under the propos...
119
click to vote
JFP
2002
15 years 1 months ago
2002
We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML...
120
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...