Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A relational theory of computing

From MaRDI portal
Publication:1145496
Jump to:navigation, search

zbMath0445.68021MaRDI QIDQ1145496

John G. Sanderson

Publication date: 1980

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


zbMATH Keywords

calculus of relationsinterpreterrelatorsrelational theory of computing


Mathematics Subject Classification ID

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


Related Items (7)

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







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1145496&oldid=13201275"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki