Getting Your Wires Crossed (2007)
This paper is about simplifying a construct in Ruby, to reduce the complexity of the algebra without sacrificing expressive power. Ruby, for which Mary Sheeran is largely responsible, is a language...
Program Optimisation, Naturally (2007)
Richard Bird, Jeremy Gibbons, Geraint Jones
this paper we derive another, quite di#erent, linear-time algorithm for reversing a list. The derivation relies on a higherorder naturality [5] property of the function unzip, the function that turns...
Exchange Rate Interventions and Insurance: Is ¿Fear of Floating¿ a Cause For Concern? (2005)
Gallego, Francisco, Jones, Geraint
Una de las características empíricas centrales de los regímenes cambiarios de las economías emergentes es el llamado ¿miedo a flotar¿. Sin embargo, mientras algunos ven el miedo a flotar como...
Exchange Rate Interventions and Insurance: Is ¿Fear of Floating¿ a Cause For Concern? (2005)
Jones, Geraint, Gallego, Francisco
Una de las características empíricas centrales de los regímenes cambiarios de las economías emergentes es el llamado ¿miedo a flotar¿. Sin embargo, mientras algunos ven el miedo a flotar como...
Hellman, Joel S., Jones, Geraint, Kaufmann, Daniel, Schankerman, Mark
As a symptom of fundamental institutional weaknesses, corruption needs to be viewed within a broader governance framework. It thrives where the state is unable to reign over its bureaucracy, to...
Hellman, Joel S., Jones, Geraint, Kaufmann, Daniel, Schankerman, Mark
As a symptom of fundamental institutional weaknesses, corruption needs to be viewed within a broader governance framework. It thrives where the state is unable to reign over its bureaucracy, to...
Program Optimisation, Naturally (1999)
Richard Bird, Jeremy Gibbons, Geraint Jones
It is well-known that each polymorphic function satises a certain equational law, called a naturality condition. Such laws are part and parcel of the basic toolkit for improving the eÆciency of...
The Under-Appreciated Unfold (1998)
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not nearly as well appreciated. We believe they deserve better. To illustrate, we present (indeed, we...
The Under-Appreciated Unfold (1998)
Folds are appreciated by functional programmers; the benefits of encapsulating common patterns of computation as higher-order operators are well-known and well understood. Their dual, unfolds, are...
Linear-time breadth-first tree algorithms: An exercise in the arithmetic of folds and zips (1993)
. This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree...
A Certain Loss of Identity (1992)
Geraint Jones, Mary Sheeran, Chalmers Tekniska Hogskola
For pragmatic reasons it is useful to exclude the identity relation from the `implementable subset' of Ruby. However there are many expressions in the relational calculus whose natural meaning...
Linear-time breadth-first tree algorithms An exercise in the arithmetic of folds and zips (1992)
This is a paper about an application of the mathematics of zip, fold (reduce) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first...
Designing Arithmetic Circuits by Refinement in Ruby (1992)
. This paper presents in some detail the systematic derivation of a static bit-level parallel algorithm to implement multiplication of integers, that is to say one which might be implemented as an...
Geraint Jones, Geraint Jones, Mary Sheeran, Mary Sheeran, Mary Sheeran
Collecting butterflies This monograph contains three papers about butterfly circuits. Circuits of this form turn up in many signal processing applications, and networks of the same shape are found in...
Deriving bit-serial circuits in Ruby (1991)
The action of bit-serial arithmetic circuits is often explained in purely pictorial terms. In contrast, this paper describes an attempt to deal with the systematic development of bit-serial...
Relations and Refinement in Circuit Design (1991)
A language of relations and combining forms is presented in which to describe both the behaviour of circuits and the specifications which they must meet. We illustrate a design method that starts by...
Designing Circuits By Calculation (1990)
algorithm Word-level algorithm Bit-level algorithm Gates Transistors Rectangles Silicon ? capture ? fabrication Figure 1.1: the design process 2 CHAPTER 1. INTRODUCTION with a more-or-less static...
Computer-Based Tools For Regular Array Design (1989)
Wayne Luk, Geraint Jones, Mary Sheeran
. We present an overview of a prototype system based on a functional language for developing regular array circuits. The features of a simulator, floorplanner and expression transformer are discussed...
Carefully Scheduled Selection With Alt (1989)
this article. Chalmers codes up something like
The meaning and implementation of PRI ALT in occam (1988)
Geoff Barrett, Michael Goldsmith, Geraint Jones, Andrew Kay
This paper describes what we believe to be an error in the implementation of PRI ALT on the inmos transputer, and exhibits anomalous behaviour of that implementation. A correct implementation of...
Timeless Truths about Sequential Circuits (1988)
We suggest the use of a declarative programming language to design and describe circuits, concentrating on the use of higher-order functions to structure and simplify designs. In order to describe...
This is a note about the distinction in occam between inputs and outputs, and between those inputs that appear as guards and those that appear as processes in their own right. It explains the...
Exchange Rate Interventions and Insurance: Is “Fear of Floating” a Cause For Concern?
Francisco Gallego, Geraint Jones
Fear of floating” is one of the central empirical characteristics of exchange rate regimes in emerging markets. However, while some view “fear of floating” in terms of the optimal ex post...
Hellman, Joel S., Jones, Geraint, Kaufmann, Daniel, Schankerman, Mark
As a symptom of fundamental institutional weaknesses, corruption needs to be viewed within a broader governance framework. It thrives where the state is unable to reign over its bureaucracy, to...
"Seize the state, seize the day": state capture, corruption, and influence in transition
Hellman, Joel S., Jones, Geraint, Kaufmann, Daniel
The main challenge of the transition has been to redefine how the state interacts with firms, but little attention has been paid to the flip side of the relationship : how firms influence the state -...
Joel S. Hellman, Geraint Jones, Daniel Kaufmann, Mark Schankerman
Recent studies have focussed on the characteristics and policies of the state to explain the extent and causes of corruption, with little attention paid to the role played by firms. Consequently, the...
Far From Home: Do Foreign Investors Import Higher Standards of Governance in Transition Economies?
Joel S. Hellman, Geraint Jones, Daniel Kaufmann
Based on the Business Environment and Enterprise Performance Survey (BEEPS) of firms in transition countries, which unbundles corruption to measure different types of corrupt transactions and provide...
Deriving the fast Fourier algorithm by calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran [1] and Bird and...