Design of symbolic-processing algorithms

DOI10.1007/BF01130083zbMATH Open0939.68956MaRDI QIDQ1895006FDOQ1895006

Authors: G. E. Tsejtlin 

Publication date: 6 August 1995

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895006)