|
definition:
|
processS :: Grappa BPMNComp BPEL
processS = edge (BPMNStart,[n1]) *>
flowS (n1,n2) <*
edge (BPMNEnd,[n2])
where n1,n2 free
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- The main parsing operation.
--- The parser works on typed hypergraphs with edges of type `BPMNComp`
--- and returns a semantic value of type `BPEL` (the BPEL corresponding
--- to the input BPMN).
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{() |-> {<*>}}
|
|
name:
|
processS
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{<*>}
|
|
signature:
|
[(BPMNComp, [Prelude.Int])] -> ([BPELComp], [(BPMNComp, [Prelude.Int])])
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|