6533b855fe1ef96bd12b1ace

RESEARCH PRODUCT

ADT implementation and completion by induction from examples

Guntis Barzdins

subject

Inductive synthesisNormalization propertyTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer scienceExistential quantificationRewritingAbstract data typeAlgorithmFast algorithmTerm (time)

description

There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.

yearjournalcountryeditionlanguage
1991-01-01
https://doi.org/10.1007/3-540-54496-8_1