Cambridge University Press

Displaying 1 - 4 of 4 results

  • Shifting the Stage

    White Papers // Nov 2011 // provided by Cambridge University Press

    It is often hard to write programs that are efficient yet reusable. For example, an efficient implementation of Gaussian elimination should be specialized to the structure and known static properties of the input matrix. The most profitable optimizations, such as choosing the best pivoting or memoization, cannot be expected of ...

    Download Now
  • Purely Functional Lazy Nondeterministic Programming

    White Papers // Aug 2011 // provided by Cambridge University Press

    Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-determinism. Yet these benefits are seldom enjoyed in functional programming because the existing features for non-strictness, sharing, and non-determinism in functional languages are tricky to combine. The authors ...

    Download Now
  • Intra-Industry Trade

    White Papers // Jun 2011 // provided by Cambridge University Press

    Once, while visiting the World Trade Organization in Geneva, the author took a three-day side trip to Cleremont-Ferrand, France in order to visit some students who were on study abroad there. At one first buffet breakfast in the hotel, he noticed an exceptional-looking blue cheese. It was as exceptional to ...

    Download Now
  • Structural Recursion With Locally Scoped Names

    White Papers // May 2011 // provided by Cambridge University Press

    Locally scoped names are an important feature of the informal meta-theory of binding operations in programming languages and logics. Nominal sets provide a fruitful mathematical model of name scoping in the presence of recursive definitions. Previous work on formal languages based on this model (Pitts & Gabbay, 2000; Schopp & ...

    Download Now