|
|
|
Description |
Functions for reifying expressions (Data / Expr) to graphs (Graph)
and to textual format.
|
|
Synopsis |
|
|
|
Documentation |
|
|
Types that represent core language programs
| | Methods | | Converts a program to a Graph
| | | Returns whether or not the program has an argument. This is needed
because the Graph type always assumes the existence of an input. So
for programs without input, the Graph representation will have a
"dummy" input, which is indistinguishable from a real input.
|
| | Instances | Computable a => Program a | (Computable a, Computable b, Computable c, Computable d, Computable e) => Program (a -> b -> c -> d -> e) | (Computable a, Computable b, Computable c, Computable d) => Program (a -> b -> c -> d) | (Computable a, Computable b, Computable c) => Program (a -> b -> c) | (Computable a, Computable b) => Program (a -> b) | (Computable a, Computable b) => Program (a, b) | (Computable a, Computable b, Computable c) => Program (a, b, c) | (Computable a, Computable b, Computable c, Computable d) => Program (a, b, c, d) |
|
|
|
|
Shows the core code generated by the program.
|
|
|
Shows the core code with size information as comments.
|
|
|
printCore = putStrLn . showCore |
|
|
printCoreWithSize = putStrLn . showCoreWithSize |
|
runGraph :: Reify a -> Info -> (a, ([Node], Info)) | Source |
|
|
|
|
|
|
Produced by Haddock version 2.6.1 |