Skip Navigation

Logic Journal of IGPL 1998 6(4):531-543; doi:10.1093/jigpal/6.4.531
© 1998 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Martínez López, P.
Right arrow Articles by Baum, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Fork algebraic datatypes

PE Martínez López and GA Baum

Departamento di Informatica, Universidad Nacional de la Plata, C.C. 11, Correo Central, 1900 La Plata, Buenos Aires, Argentina e-mail: fidel@info.unlp.edu.ar e-mail: gbaum@info.unlp. edu.ar

Program synthesis is a process that obtains an efficient program out of a specification, preserving its meaning. Fork algebras have been proposed as an algebraic basis for the construction of a program synthesis environment. These algebras have an expressive power that encompasses that of first order logic, and they are also the right abstraction of the set model that considers programs as partial (input-output) binary relations; these results make fork algebras a sound and powerful framework for this task.

An important step in the software construction process is the correct selection and manipulation of datatypes, because they are a powerful tool - with them modularization is easy, and enhancement of readability and early error detection are obtained. Algebraic datatypes (generated by a set of constructors), are an important class of datatypes because their properties are of great relevance in program transformation.

The main goals of this work are to provide a general mechanism for defining algebraic datatypes in the framework of fork algebras, and, at the same time, establish a syntax that simplifies the notation for the specifications.

Keywords:Fork algebras, Program Construction, Program Derivation, Datatypes


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.