Add to ORKGThis work presents the Brisk Machine, a machine model for the implementation of functional languages. It is especially designed to be flexible and dynamic, so that it can support a uniform and efficient implementation of multiple paradigms such as computational mobility, dynamic loading and linking, and logic programming. The Brisk Machine is based on the STG Machine, though its model is simplified and adapted so that the various paradigms it supports can be accommodated easily without interference between them
Abstract: The Krivine machine is a simple and natural implementation of the normal weak-head reducti...
technical reportThe FLEX system consists of merged 'hardware' and 'software' that is optimized towar...
Abstract. A variant of Turing machines is introduced where the tape is replaced by a single tree whi...
Machine The Functional Abstract Machine (Fam) is a stack machine designed to support functional lang...
This paper describes a computer architecture for execution of lazy functional languages. The archite...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
Lazy functional languages seem to be unsuitable for programming embedded computers because their imp...
Functional programming languages offer a new programming paradigm with many advantages over the more...
We express implementations of functional languages as a succession of program transformations in a c...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
Distributed implementations of programming languages with implicit parallelism hold out the prospect...
For some, functional languages hold the promise of allowing ease of programming massively parallel c...
The declarative nature of functional programming languages causes many difficulties in their efficie...
In this paper we discuss implementation issues concerned with a new abstract machine for executing ...
This paper introduces a new high level programming language for a novel class of computational devic...
Abstract: The Krivine machine is a simple and natural implementation of the normal weak-head reducti...
technical reportThe FLEX system consists of merged 'hardware' and 'software' that is optimized towar...
Abstract. A variant of Turing machines is introduced where the tape is replaced by a single tree whi...
Machine The Functional Abstract Machine (Fam) is a stack machine designed to support functional lang...
This paper describes a computer architecture for execution of lazy functional languages. The archite...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
Lazy functional languages seem to be unsuitable for programming embedded computers because their imp...
Functional programming languages offer a new programming paradigm with many advantages over the more...
We express implementations of functional languages as a succession of program transformations in a c...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
Distributed implementations of programming languages with implicit parallelism hold out the prospect...
For some, functional languages hold the promise of allowing ease of programming massively parallel c...
The declarative nature of functional programming languages causes many difficulties in their efficie...
In this paper we discuss implementation issues concerned with a new abstract machine for executing ...
This paper introduces a new high level programming language for a novel class of computational devic...
Abstract: The Krivine machine is a simple and natural implementation of the normal weak-head reducti...
technical reportThe FLEX system consists of merged 'hardware' and 'software' that is optimized towar...
Abstract. A variant of Turing machines is introduced where the tape is replaced by a single tree whi...