Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog
作者： Marc Bergman , Pierre Deransart
关键词: Confluence 、 Operational semantics 、 Abstract data type 、 Generalized algebraic data type 、 Programming language 、 Computer science 、 Prolog 、 Theoretical computer science 、 Algebraic number 、 Rewriting
摘要: The aim of the paper is to present operational semantics Algebraic Abstract Data Types (AAT) in terms rewriting systems and their programming PROLOG respectively.
springer.com
sci-hub.st 参考文章(6)
Leon Sterling, Alan Bundy, Meta-level inference and program verification conference on automated deduction. pp. 144- 150 ,(1982) , 10.1007/BFB0000056
Gérard Huet, Derek C. Oppen, Equations and rewrite rules: a survey Formal Language Theory#R##N#Perspectives and Open Problems. pp. 349- 405 ,(1980) , 10.1016/B978-0-12-115350-2.50017-8
Gerard Huet, Jean-Marie Hullot, Proofs by induction in equational theories with constructors Journal of Computer and System Sciences. ,vol. 25, pp. 239- 266 ,(1982) , 10.1016/0022-0000(82)90006-X
J. A. Goguen, How to prove algebraic inductive hypotheses without induction 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. pp. 356- 373 ,(1980) , 10.1007/3-540-10009-1_27
J.V. Guttag, J.J. Horning, The algebraic specification of abstract data types Acta Informatica. ,vol. 10, pp. 27- 52 ,(1978) , 10.1007/BF00260922
John Guttag, Abstract data types and the development of data structures Communications of the ACM. ,vol. 20, pp. 396- 404 ,(1977) , 10.1145/359605.359618