Ketchup and Bananas

Talking Bananas

Session types provide static guarantees that concurrent programs respect communication protocols. We give a novel account of recursive session types in the context of GV, a small concurrent extension of the linear λ-calculus. We extend GV with recursive types and catamorphisms, following the initial algebra semantics of recursion, and show that doing so naturally gives rise to recursive session...

Bananas, Dark Worlds, and AspectH

This report summarises our idea of code clone detection in Haskell code and refactorings based on identified clones as it evolved in our group-of-three discussion. 1 Motivation Looking at the code example below, we observe a certain level of redundancy, in particular structural redundancy, such as pattern matching , if-then-elseconstructs, and recursion . addOdds :: Integral a => [a] -> a addOd...

Dealing with Large Bananas

Many problems call for a mixture of generic and speci c programming techniques. We propose a polytypic programming approach based on generalised (monadic) folds where a separation is made between basic fold algebras that model generic behaviour and updates on these algebras that model speci c behaviour. We identify particular basic algebras as well as some algebra combinators, and we show how t...

The Ketchup Marketplace : Retailer , Manufacturers , and Individual Consumers ∗

We construct a model of a local ketchup market of a city in Texas that accounts for household, manufacturer, and retailer decisions. That is, the model develops both the demand and the supply side of the market. The demand side is modeled through a latent utility framework allowing for the ‘no-purchase’ option. Accounting for both sides of the market allows one to check for any endogeneity prob...

The Biology of Bananas and Plantains