Brisk(ID:3656/bri005)

for Bristol Haskell System

University of Bristol, 1995

Ian Holyer, Neil Davies, and Chris Dornan

Concurrent and Distributed Functional language

Structures:
Related languages
Haskell => Brisk   Augmentation of
References:
  • Ian Holyer, Neil Davies, and Chris Dornan "The Brisk Project: Concurrent and Distributed Functional Systems" Technical Report CSTR-95-015, Department of Computer Science, University of Bristol, June 1995 view details Abstract: The Brisk project has been set up to investigate the possibility of extending the expressive power of pure functional languages. The aim is to be able to build concurrent and distributed working environments completely functionally, reversing the usual situation in which functional programs are regarded as guests within a procedural environment. This paper gives an overview of the project.
    The Bristol Haskell System, or Brisk for short, is based on a compiler for the Haskell functional programming language which is used to provide practical support for this research, and to demonstrate its results. The compiler adds a purely deterministic form of concurrency to Haskell in order to improve support for interactive and distributed programming. This has been used, for example, to build an interface to the X window system. Features have also been added to support the dynamic loading and migration of code. This allows for a purely functional implementation of long-lived shell programs which manage files, processes and communications.

    bib:
    @techreport{1995-holyer,
      number={CSTR-95-015},
      title={The Brisk Project: Concurrent and Distributed Functional Systems},
      author={Ian Holyer and Neil Davies and Chris Dornan},
      bpages={11},
      rpages={0},
      institution={Department of Computer Science, University of Bristol},
      month={June},
      year={1995},
      abstract={The Brisk project has been set up to investigate the
    possibility of extending the expressive power of pure functional languages.
    The aim is to be able to build concurrent and distributed working environments
    completely functionally, reversing the usual situation in which functional
    programs are regarded as guests within a procedural environment. This
    paper gives an overview of the project.

    The Bristol Haskell System, or Brisk for short, is based on a compiler
    for the Haskell functional programming language which is used to provide
    practical support for this research, and to demonstrate its results.
    The compiler adds a purely deterministic form of concurrency to Haskell
    in order to improve support for interactive and distributed programming.
    This has been used, for example, to build an interface to the X window
    system. Features have also been added to support the dynamic loading
    and migration of code. This allows for a purely functional implementation
    of long-lived shell programs which manage files, processes and communications.
    },
      source={tech-reports/1995/1995-holyer.ps.gz},
      pubtype={6}
    }

    ps
  • Spiliopoulou, Eleni; Holyer, Ian and Neil Davies "Distributed Programming, a purely functional approach" view details Abstract: Many application programs are now distributed. Despite the number of distribution models, distributed programs still suffer from great complexity and therefore lack of resilience and trustability, mainly due to the non-deterministic underlying communication primitives. Based on the theory of deterministic concurrency, which preserves the declarative semantics and therefore ensures trustability, we outline a novel demand-driven computational model which allows for trustable distribution of computation. ps
          in Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, (ICFP '97) June 1997 view details
  • I Holyer and E Spiliopoulou. "The Brisk Machine: A Simplified STG Machine" in Implementation of Functional Languages, 9th International Workshop, IFL'97, St. Andrews, Scotland, UK, September 1997, Selected Papers, LNCS 1467, pages 20--38. Springer-Verlag, August 1998 view details Abstract: This 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.
    bib:
    @inproceedings{1998-holyer,
      title={The Brisk Machine: A Simplified STG Machine},
      author={I Holyer and E Spiliopoulou},
      Booktitle={Implementation of Functional Languages, 9th International Workshop, IFL'97, St. Andrews, Scotland, UK, September 1997, Selected Papers, LNCS 1467},
      ISBN={3-540-64849-6},
      publisher={Springer-Verlag},
      pages={20--38},
      month={August},
      year={1998},
      keywords={Functional_Programming},
      abstract={This 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. },
      source={tech-reports/1998/1998-holyer.ps.gz},
      pubtype={4}
    }

    ps
          in Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, (ICFP '97) June 1997 view details
  • Ian Holyer and Eleni Spiliopoulou. "The Brisk Machine: A Simplified STG Machine" Technical Report CSTR-98-003, Department of Computer Science, University of Bristol, March 1998 view details Abstract: The Brisk Abstract Machine is the machine model used for the implementation of the Bristol Haskell Compiler (Brisk). It is especially designed to support new paradigms in functional languages like concurrency, distribution and computational mobility, dynamic loading and linking, debugging tools, and logic programming in the form of the Escher extensions to Haskell.
    The Brisk Abstract Machine is based on the STG-machine, though its model is simplified and adapted. Extensions can now be added in this flexible model to provide the desired paradigms.
    bib:
    @techreport{1998-holyer.ps,
      number={CSTR-98-003},
      title={The Brisk Machine: A Simplified STG Machine},
      author={Ian Holyer and Eleni Spiliopoulou},
      bpages={20},
      rpages={0},
      institution={Department of Computer Science, University of Bristol},
      month={March},
      year={1998},
      keywords={Functional_Programming},
      abstract={The Brisk Abstract Machine is the machine model used
    for the implementation of the Bristol Haskell Compiler (Brisk). It
    is especially designed to support new paradigms in functional languages
    like concurrency, distribution and computational mobility, dynamic
    loading and linking, debugging tools, and logic programming in the
    form of the Escher extensions to Haskell.

    The Brisk Abstract Machine is based on the STG-machine, though its
    model is simplified and adapted. Extensions can now be added in this
    flexible model to provide the desired paradigms. },
      source={tech-reports/1998/1998-holyer.ps.ps.gz},
      pubtype={6}
    }

    ps
          in Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, (ICFP '97) June 1997 view details