A connotational theory of program structure
From MaRDI portal
Publication:579920
zbMath0625.68018MaRDI QIDQ579920
Publication date: 1987
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
effective numberingsindependence of control structureslanguage independent theory of program structurerecursive function theory
Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items (20)
Program size restrictions in computational learning ⋮ Effectivity Questions for Kleene’s Recursion Theorem ⋮ Learnability: Admissible, co-finite, and hypersimple languages ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Parsimony hierarchies for inductive inference ⋮ Spatial/kinematic domain and lattice computers ⋮ Learning-theoretic perspectives of acceptable numberings ⋮ Machine induction without revolutionary paradigm shifts ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Program self-reference in constructive Scott subdomains ⋮ Hypothesis spaces for learning ⋮ Costs of general purpose learning ⋮ Computable one-to-one enumerations of effective domains ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Characterizing programming systems allowing program self-reference ⋮ Unnamed Item ⋮ Maximal machine learnable classes ⋮ The synthesis of language learners. ⋮ Composition is almost (but not quite) as good as \(s-1-1\)
This page was built for publication: A connotational theory of program structure
