Sciweavers

1805 search results - page 1 / 361
» Functional programming with structured graphs
Sort
View
ICFP
2012
ACM
11 years 7 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
ENTCS
2007
112views more  ENTCS 2007»
13 years 4 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
PPDP
2009
Springer
13 years 11 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
13 years 8 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 8 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig