[<<][staapl][>>][..]Thu Jul 16 09:07:13 CEST 2009
I've seen invertable functions before in PLT: in the web server:
(struct stuffer (in out))
in : (any/c . -> . any/c)
out : (any/c . -> . any/c)
A stuffer is essentially an invertible function captured in this
structure. The following should hold:
(out (in x)) = x
(in (out x)) = x
Then it defines a composition operation for these. Another thing to
think about is constraint based programming from SICP, and in the
Guy Steele thesis. See also thread on LtU.
The CP approach in a nutshell:
- define primitive constraints as a collection of directed
- define constraint composition (network)
- find a way to transform an undirected constraint network into a
directed data flow graph
So it looks like the current dataflow graph code in Staapl could be
re-used for representing the more general constraint problem.
What would be the primitive constraints for a decoder? Essentially,
how can it be factored?