Taverna Semantics

• Full Document as
  • PDF
  • LaTeX source from anonymous CVS:
    • Host: cvs.mygrid.info
    • Path: /usr/local/cvs/mygrid
    • Module: mygrid/doc/taverna-semantics

Language

• Lambda calculus with cartesian products and a strong monad [1].
  • The monad is the free monoid monad [4]
    • algebras of this monad are monoids [4]
  • A strength A x TB --> T(A x B) for this monad
  • Product interplay with the Monad
    • iterations

Operational Semantics

• Lazy evaluation [8]
• Value-passing bisimulation [9]

Suggestions

1. Make the monad visible as boxing operator, so that users are visually aware of the iterations/type reconcilations taking place. (This is consistent with Paul Fisher's experience as a user.)
2. Make the unit and multiplication of the monad (ie one-element list wrapper and flattening) primitive operations rather than processors.
3. Maybe more natural to use the computational lambda calculus, ie to use lists as uniform return type, with simple strings seen as one-element lists.

References

1. Notions of computation and monads
2. Computational lambda calculus
3. Computational lambda calculus - semantics
4. Semantics of Weakening and Contraction BibTex (available electronically via university library)
5. A Structural approach to Operational Semantics
6. Computational Interpretations of Linear Logic
7. Semantics of Weakening and Contraction
8. The lazy lambda calculus
9. Semantics of Name and Value Passing

• A process calculus with static fusions
• Typed λ-calculus: From Pure To Effectful
• The duality of computation
• A theory of bisimulation for a fragment of concurrent ML with local names
• Combining the typed λ-calculus with CCS