Symposium on semantics of algorithmic languages
From MaRDI portal
Publication:2545843
DOI10.1007/BFb0059689zbMath0215.56004OpenAlexW40115808MaRDI QIDQ2545843
No author found.
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
Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Semantics in the theory of computing (68Q55) Logic programming (68N17) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items (7)
Formal model of internal measurement: Alternate changing between recursive definition and domain equation ⋮ Partially additive categories and flow-diagram semantics ⋮ Appearance of hierarchical structure in hyper-dilation model: Model of generalized measurement process ⋮ Orthomodular lattice obtained from addressing a fixed point ⋮ Operational semantics: concepts and their expression ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems ⋮ Calvin C. Elgot (1922-1980)
This page was built for publication: Symposium on semantics of algorithmic languages
