Typed Lambda Calculus Discussion 2008-08-27
Present: Randall Britten, Justin Marsh, Andrew Miller, Poul Nielsen
Justin noted that there were several existing languages with type systems which we could look at for ideas: Haskell, the ML family and Coq.
There was some discussion about how we could use ideas from these languages. One option would be to actually embed the language itself into CellML as CDATA nodes, although Andrew and Justin were not very keen on this idea, as it makes it harder to use XSL stylesheets and would significantly increase the implementation burden.
However, it is also possible to take the operators from these languages and map them to an equivalent content MathML representation.
There was also agreement that more examples of how the constructs can be used for modelling applications would be useful.
Justin noted that there were several existing languages with type systems which we could look at for ideas: Haskell, the ML family and Coq.
There was some discussion about how we could use ideas from these languages. One option would be to actually embed the language itself into CellML as CDATA nodes, although Andrew and Justin were not very keen on this idea, as it makes it harder to use XSL stylesheets and would significantly increase the implementation burden.
However, it is also possible to take the operators from these languages and map them to an equivalent content MathML representation.
There was also agreement that more examples of how the constructs can be used for modelling applications would be useful.