A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine
[chapter]
1986
Lecture Notes in Computer Science
Preserved Fulltext
This
article
describes
GRAAL
(General
Recursive
Applicative
and
Algorithmic
Language),
a
functional
programming
language
and its
virtual reduction
machine. ...
Bellot and B. Robinet
Functional proqrammin q w~th ~Lngurryf~ed combinators,
First
Workshop on Reduction Machines, to appear in LNC8,
Ustica (Italy), 1985.
[6]
[8]
J.H. ...
doi:10.1007/3-540-16442-1_6
fatcat:6gmyqzxsa5hjzjamiyr5nrcoxy
Proposal for a natural formalization of functional programming concepts
1988
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The list can be a linked list constructed with a pairing operator or a tuple of values [2] , Lisp Systems and FP Systems use this method and it is possible to program functions with variable arity. ...
Définitions of primitive functions and functionals are given using réduction rules. Consequently, Graal is implemented as a virtual graph réduction machine running on Von Neumann architectures [7] . ...
doi:10.1051/ita/1988220303411
fatcat:4oytquplojdrph4pc4ewalb5hi
Extending functional programming towards relations
[chapter]
1988
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The first section presents the main features of the proposed language and it is shown how relations make programs more flexible and natural. ...
Because a function is a particular case of relation, we can consider the computation of points-to-set processes (relations) instead of points-to-point processes (functions). ...
Bellot and V. Jay for their generous contribution to this paper. I also thank O. Danvy, A. Belkhir, D. Sarni and C.T. Lieu for interesting discussions. ...
doi:10.1007/3-540-19027-9_14
fatcat:jub4h7beybdgpc5kkzrzlokz5y
A theory for natural modelisation and implementation of functions with variable arity
[chapter]
1987
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
graph reduction machines. ...
The aim of this article is to provide a new theorical framework based on combinators for the study and implementation of applicative programming languages. ...
Graal has been designed using uncurryfied combinators for efficiency and generalized functional forms of FP systems for clarity. ...
doi:10.1007/3-540-18317-5_13
fatcat:d6eiaxwmmrcgrnnov6gbqklhsy