Computability concepts for programming language semantics

DOI10.1016/0304-3975(76)90029-3zbMath0352.68042OpenAlexW2001008439MaRDI QIDQ1235972

Herbert Egli, Robert L. Constable

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90029-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Related Items (20)

Two categories of effective continuous cpos ⋮ Effectively given domains ⋮ Some results related to the continuity problem ⋮ On the algebra of order ⋮ Embedding metric spaces into CPO's ⋮ Domain theory in logical form ⋮ Effectivity and effective continuity of multifunctions ⋮ On the Continuity of Effective Multifunctions ⋮ On effective topological spaces ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Computable one-to-one enumerations of effective domains ⋮ Unnamed Item ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Semantics of algorithmic languages ⋮ Order completion monads ⋮ A uniform approach to inductive posets and inductive closure ⋮ Admissible representations of effective cpo's ⋮ Type 2 recursion theory ⋮ Theory of representations

Uses Software

• LCF

Cites Work

• On Classes of Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability concepts for programming language semantics