Logic and programming languages
From MaRDI portal
Publication:4127363
DOI10.1145/359810.359826zbMath0355.68019OpenAlexW2090258249WikidataQ56067341 ScholiaQ56067341MaRDI QIDQ4127363
Publication date: 1977
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359810.359826
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (5)
\({\mathbf Z}\)-continuous posets ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Compilation of the ELECTRE reactive language into finite transition systems ⋮ Semantics of algorithmic languages ⋮ The complexity of type inference for higher-order typed lambda calculi
This page was built for publication: Logic and programming languages
