JUCS - Journal of Universal Computer Science 23(1): 89-111, doi: 10.3217/jucs-023-01-0089
A General Method for Defining Objects by Recursion over Syntax
expand article infoSimon Thompson‡
‡ University of Kent, Canterbury, United Kingdom

Corresponding author: Simon Thompson ( s.j.thompson@kent.ac.uk )

© Simon Thompson.
This article is freely available under the J.UCS Open Content License.
Citation: Thompson S (2017) A General Method for Defining Objects by Recursion over Syntax. JUCS - Journal of Universal Computer Science 23(1): 89-111. https://doi.org/10.3217/jucs-023-01-0089
Open Access
Abstract
In this paper we look back to work done in the late 1980s, and that looked at links between grammars, data types and recursion principles, and illustrating it with examples that include enumerations of types and developing a structure editor. The work is introduced by a historical foreword, and closes with an afterword that discusses some of the subsequent developments of these ideas.
Keywords
algebraic data type, coinduction, generic programming, grammar, higherorder function, Miranda, recursor, syntax, verification