scientific article; zbMATH DE number 3942987
[For the entire collection see Zbl 0578.00005.] This work presents a new programming language issued from functional programming systems of J. W. Backus. GRAAL is a functional programming language without variables. The basic tools provided for expressing functions are functional forms in FP systems. The main change is that functional forms are constructed using uncurryfied combinators, that is polyadic combinators. The introduction of a new kind of functional form (user form) allows users of the system to define their own functional forms and to compute them dynamically. Another difference with FP systems is that functions are polyadic. The main consequence of these choices is an efficient reduction machine, implementing the language, which is described here. Independently of efficiency considerations, GRAAL seems to be a realistic programming language.
- Graph rewriting semantics for functional programming languages
- Functional programming framework for \textit{GRworkbench}
- scientific article; zbMATH DE number 4096777
- scientific article; zbMATH DE number 3846829
- scientific article; zbMATH DE number 969070
- The Rewriting Calculus as a Combinatory Reduction System
- Theoretical Computer Science
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
- Functional programming framework for \textit{GRworkbench}
- Grail: a functional form for imperative mobile code
- scientific article; zbMATH DE number 4016174 (Why is no real title available?)
- scientific article; zbMATH DE number 3917684 (Why is no real title available?)
- scientific article; zbMATH DE number 3980453 (Why is no real title available?)
- Proposal for a natural formalization of functional programming concepts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713558)