A relational theory of computing

MaRDI QIDQ1145496zbMATH OpenFDO

Authors John G. Sanderson

Publication date 1980

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

calculus of relationsinterpreterrelational theory of computingrelators

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(7)

• Relations, dependencies, and some problems of systems theory
• A practical method for implementing string pattern matching machines
• An improvement of the Aho-Corasick machine
• Normal forms for binary relations
• Regularity of relations: A measure of uniformity
• Specification methodology: An integrated relational approach
• Strongest invariant functions: Their use in the systematic analysis of while statements

This page was built for publication: A relational theory of computing

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