Design of symbolic-processing algorithms

DOI10.1007/BF01130083zbMath0939.68956MaRDI QIDQ1895006

G. E. Tsejtlin

Publication date: 6 August 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (1)

Integrated tools for design and synthesis of classes of algorithms and programs

Cites Work

• Unnamed Item
• Unnamed Item
• The Galois connection between partial operations and relations
• Maximal local classes of partial functions of infinite-valued logic
• Une généralisation de la notion de corps
• The algebras of partial functions and their invariants
• Extension of not everywhere defined functions of many-valued logic
• Universal algebras with all operations of bounded range

This page was built for publication: Design of symbolic-processing algorithms