Symposium on semantics of algorithmic languages

DOI10.1007/BFB0059689MaRDI QIDQ2545843zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0059689

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited in

(7)

• Formal model of internal measurement: Alternate changing between recursive definition and domain equation
• Partially additive categories and flow-diagram semantics
• Orthomodular lattice obtained from addressing a fixed point
• Appearance of hierarchical structure in hyper-dilation model: Model of generalized measurement process
• Calvin C. Elgot (1922-1980)
• Operational semantics: concepts and their expression
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems

This page was built for publication: Symposium on semantics of algorithmic languages

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