On Tue, Feb 8, 2011 at 2:01 PM, Alexander Solla <[email protected]> wrote: > It is hard to come up with a single operational semantic for types, because > they do so many different things, and there is a semantic for each > interpretation.
G. Hillebrand, P. C. Kanellakis (in paper "Functional Database Query Languages as Typed Lambda Calculi of Fixed Order" and others) encoded tuples, lists, tables, the relational algebra, complex objects, and others in typed lambda calculus. The different things (I guess we can call them types here) were able to be compared with the uniformed (opeartional) semantics.
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
