Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG

Marc Bergman,Pierre Deransart

doi:10.1007/3-540-10828-9_57

Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG

Marc Bergman, Pierre Deransart

https://doi.org/10.1007/3-540-10828-9_57

Copy DOI

Publication Date: Jan 1, 1981

Citations: 6

Affiliation: French Institute for Research in Computer Science and Automation, Centre d’Immunologie de Marseille-Luminy

#Algebraic Data Types #Programming In PROLOG + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The aim of the paper is to present the operational semantics of Algebraic Abstract Data Types (AAT) in terms of rewriting systems and their programming in PROLOG respectively.An AAT is considered as an interpretor, the semantical actions of which are rewrite rules.The power of the methodology makes it possible to construct one and many-sorted types, and may be used as an aid for proofs of properties.This approach leads to a clean, rapid, and accurate programming close to the abstract specification of the type. Proofs by "constructor induction" or Knuth-Bendix algorithm of equational properties valid in initial or final models may be programmed in PROLOG.

Full Text