Burstall, R. M.: Design considerations for a functional programming language. In Proc. of the Infotech State of the Art Conference, Copenhagen, 1977.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... equivalence classes of abstract syntax trees as the elements of an inductively de ned set, rather than just the quotient of such a set. Moreover, this can be done in such a way that the techniques of structural induction and recursion, which Burstall did so much to promote in computer science [Bur69, Bur77], extend in a pleasant fashion from conventional algebraic datatypes to ones involving variable binding operations. But of course using a di erent set theory, even though it is very close to the usual one, is not a step to be undertaken lightly; so we begin with a critique of the current state of ....

Burstall, R. M.: Design considerations for a functional programming language. In Proc. of the Infotech State of the Art Conference, Copenhagen, 1977.

....rather than as closures. All of this work is based on providing some notion of implementation inheritance for object oriented languages. We are the first to suggest a form of implementation inheritance for a functional language, based on adding inheritance mechanisms to the module system. Burstall [5] proposed a functional language NPL (a predecessor to HOPE [6] with extensible datatypes and function definitions, in which constructors could be incrementally added to the definition of a datatype, and clauses could be incrementally added to the definitions of functions that operated on that ....

R. M. Burstall. Design considerations for a functional programming language. In Infotech State of the Art Conference, Copenhagen, Denmark, 1977. Infotech.

....programs. For this reason, many high level languages offer only a fixed set of high level constructs with pre defined semantics rather than provide the user with the complete flexibility and the raw power of a low level kernel language. The list comprehension mechanism, first introduced in NPL [Bur77, Dar77] and later adopted in Miranda [Tur85] and Haskell, is an example of such a language construct. From a language design standpoint, a powerful type system can be used to enforce the type abstraction desired for kernel language implementations of high level datatypes in libraries without ....

Rod M. Burstall. Design Considerations for a Functional Programming Language. In Infotech State of the Art Conference: The Software Revolution, October 1977.

....languages upon which we focus here. Modern functional programming languages permit user de ned data types, with pattern matching in de nitions of functions on these data types. 1 For object 1 As far as we know, this feature was introduced into functional programming by Rod Burstall: see [2, 1]. A Metalanguage for Programming with Bound Names 231 languages without variable binding, this reduces the work involved in designing representations to a mere act of declaration: a speci cation of the abstract syntax of the object language gives rise more or less directly to the declaration of ....

R. M. Burstall. Design considerations for a functional programming language. In Proc. of the Infotech State of the Art Conference, Copenhagen, 1977.

....University Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, UK. e mail: Andrew.Pitts cl.cam.ac.uk 1 This paper is dedicated to Rod Burstall. It is a revised and expanded version of [GP99] M. J. Gabbay and A. M. Pitts recursion, that Burstall did so much to promote in computer science [Bur69, Bur77], extend in a pleasant fashion from conventional algebraic datatypes to ones involving variable binding operations. But of course using a di erent set theory, even though it is very close to the usual one, is not a step to be undertaken lightly; so we begin with a critique of the current state of ....

R. M. Burstall. Design considerations for a functional programming language. In Proc. of the Infotech State of the Art Conference, Copenhagen, 1977.

....a largely functional core language and has been popular with the functional programming community. Whether a value is mutable or not is denoted by its type. ML also included user defined algebraic and abstract data types and pattern matching although these innovations were earlier found in Hope [Burs77,Burs80]. Indeed pattern matching originated in the procedural world with SNOBOL [Farb64] Type checking in ML is done by inference which automatically computes the most general type of each expression and allows the programmer to omit type assertions from the program. Laziness has become prevalent in ....

Burstall, R.M., Design Considerations for a Functional Programming Language, In Infotech State of the Art Conference. The Software Revolution. Infotech, Copenhagen 1977

....scopes. 3. THE HOPE PROGRAI4ING LANGUAGE A programming language called HOPE which illustrates the features mentioned above has been designed and implemented at Edinburgh University. A brief informal description of HOPE follows; full details can be found in [9] A precursor, NPL, was described in [5]. The aim throughout was to design a programming language which was very simple and encouraged clarity and manipulability of programs. Major influences in the design of HOPE have been LISP and Landin s ISWIM [24] We were not trying to be original; we sought a judicious selection of well ....

Burstall, R.M. Design Considerations for a Functional Programming Language. Infotech State of the Art Conference: The Software Revolution, Copenhagen, October, 1977. 142

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC