Results

**11 - 16**of**16**### Concurrent and Distributed Functional Systems

- DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF BRISTOL
, 1999

"... This thesis presents the Brisk Machine [54], a machine for executing functional languages, designed to be simple and flexible to support a number of run-time execution models for the Brisk compiler. Design considerations have been made to support dynamic loading, deterministic concurrency [23,51], d ..."

Abstract
- Add to MetaCart

This thesis presents the Brisk Machine [54], a machine for executing functional languages, designed to be simple and flexible to support a number of run-time execution models for the Brisk compiler. Design considerations have been made to support dynamic loading, deterministic concurrency [23,51], distribution, debugging tools and logic programming [76]. To achieve this, the compiler's intermediate language, the Brisk Kernel Language BKL is simpler than the STG language [100], as evaluation, extension and optimisation issues are relegated to special built-in functions. Moreover, function calls are saturated, as any function has an known arity and in every call to it, is applied to the rightnumber of arguments, which makes the machine dynamic and supports dynamic loading. To incorporate

### Stream processors and nested fixedpoints

, 2007

"... We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation of the representations of two continuous functions between streams that yields a representa ..."

Abstract
- Add to MetaCart

(Show Context)
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation of the representations of two continuous functions between streams that yields a representation of their composite. In the case of discrete-valued functions, the representatives are well-founded (finite-path) trees of a certain kind. The underlying idea can be traced back to Brouwer’s justification of bar-induction, or to Kreisel and Troelstra’s elimination of choice-sequences. In the case of stream-valued functions, the representatives are non-wellfounded trees pieced together in a coinductive fashion from well-founded trees. The definition requires an alternating fixpoint construction of some ubiquity. In neither case are the representatives unique. There may be many distinct repre-sentatives of extensionally the same function. Nevertheless, the distinctions between them capture genuine differences in computational behaviour. These representations (the data structures and their decoding functions) have a simple (if imperfect) ex-

### CHRISTIAN-ALBRECHTS-UNIVERSITÄT

, 1998

"... completing a-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments ..."

Abstract
- Add to MetaCart

(Show Context)
completing a-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments

### Turning A Functional Data Type Into A Concurrent Programming Language

"... There is a recurrent dilemma in the design of concurrent programming languages. On the one hand the language should be small and coherent, and on the other, all communication constructs needed by the programmer should be provided. We present an approach for remedying this dilemma in the functional ..."

Abstract
- Add to MetaCart

There is a recurrent dilemma in the design of concurrent programming languages. On the one hand the language should be small and coherent, and on the other, all communication constructs needed by the programmer should be provided. We present an approach for remedying this dilemma in the functional programming framework. It consists of building into the language only a few simple primitives which are represented by constructors of a distinguished algebraic data type. This way, a two-layer process language containing a pure functional core is created for which referential transparency is guaranteed by construction. Because these constructors are first-class decomposable objects of the language, they serve as building blocks from which the programmer can construct advanced communication constructs within the language in a purely functional way. The paper argues that functional data terms containing Perry-style continuations [Perry 90] are sufficiently expressive to denote processes. The...

### Brouwerian stream processors

, 2007

"... We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation of the representations of two continuous functions between streams that yields a representa ..."

Abstract
- Add to MetaCart

(Show Context)
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation of the representations of two continuous functions between streams that yields a representation of their composite. In the case of discrete-valued functions, the representatives are well-founded (finite-path) trees of a certain kind. The underlying idea can be traced back to Brouwer’s justification of bar-induction, or to Kreisel and Troelstra’s elimination of choice-sequences. In the case of stream-valued functions, the representatives are nonwellfounded trees pieced together in a coinductive fashion from well-founded trees. The definition requires an alternating fixpoint construction of some interest. In neither case are the representatives unique. There may be many distinct representatives of extensionally the same function. Nevertheless, the distinctions between them capture genuine differences in computational behaviour. These representations (the data structures and their decoding functions) have

### British Computer Society BCS Experiences with Clean I/O

"... ©Copyright in this paper belongs to the author(s) Published in collaboration with the ..."

Abstract
- Add to MetaCart

©Copyright in this paper belongs to the author(s) Published in collaboration with the