Besides the original idea of having a framework for calculating programs from their specifications, avoiding general recursion is also important from a programming methodology point of view. For instance, Meijer et al. [22] stress in their often cited paper the aspect that using folds in functional languages is truly in the spirit of the structured programming methodology. Similar beliefs, that is, avoiding general recursion and using a fixed set of higher order functions, had been already emphasized before by Backus [1]. The programming languages CP
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...
This paper has explored three examples of good semantical analyses of programming structures. The th...
Specifying data structures is important in programming languages. One approach uses initial algebras...
An important step from computer science to a true discipline of software engineering is to impose di...
AbstractThis paper lifts earlier category-theoretic results on datatypes to the level of an abstract...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
AbstractCourse-of-value recursion is a scheme which allows us to define the value of a function in s...
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about ...
This paper lifts the category-theoretic results of [4] to the level of an abstract language suitable...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
We consider the interaction of recursion with extensional data types in several typed functional pro...
We extend the structured recursive programming discipline, which favors the use of fold operations i...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
Heterogeneous algebraic theories and algebras are treated in detail with examples showing how to mod...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...
This paper has explored three examples of good semantical analyses of programming structures. The th...
Specifying data structures is important in programming languages. One approach uses initial algebras...
An important step from computer science to a true discipline of software engineering is to impose di...
AbstractThis paper lifts earlier category-theoretic results on datatypes to the level of an abstract...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
AbstractCourse-of-value recursion is a scheme which allows us to define the value of a function in s...
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about ...
This paper lifts the category-theoretic results of [4] to the level of an abstract language suitable...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
We consider the interaction of recursion with extensional data types in several typed functional pro...
We extend the structured recursive programming discipline, which favors the use of fold operations i...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
Heterogeneous algebraic theories and algebras are treated in detail with examples showing how to mod...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...
This paper has explored three examples of good semantical analyses of programming structures. The th...
Specifying data structures is important in programming languages. One approach uses initial algebras...