Program Separation as a Basis for Definitional Higher Order Programming
Program Separation as a Basis for Definitional Higher Order Programming
Göran Falkman
In 6th
NWPT, pages 158-172
Abstract:
We describe a program separation scheme based on a notion of
form and content of an algorithm. We show that this type of program
separation is one way of making algorithms an explicit part of declarative
programming. We also show how this type of program separation can be used as
a basis for definitional higher order programming.
Comments
Department of Computing Science, Chalmers University of
Technology, S-412 96 Göteborg, Sweden.
Available as PostScript,
DVI.
![[BRICS symbol]](http://www.daimi.aau.dk/BRICS/GIF/BRICS/msymbol8mm.GIF)
BRICS WWW home page