Computability concepts for programming language semantics

DOI10.1016/0304-3975(76)90029-3MaRDI QIDQ1235972zbMATH OpenOpenAlexFDO

Authors Herbert Egli, Robert 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

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

Cites work

• scientific article; zbMATH DE number 3163761 (Why is no real title available?)
• scientific article; zbMATH DE number 3566824 (Why is no real title available?)
• scientific article; zbMATH DE number 3249775 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• On Classes of Program Schemata

Cited in

(20)

• Type 2 recursion theory
• Embedding metric spaces into CPO's
• scientific article; zbMATH DE number 7568608 (Why is no real title available?)
• Two categories of effective continuous cpos
• Domain theory in logical form
• A uniform approach to inductive posets and inductive closure
• Computability in higher types, P and the completeness of type assignment
• Computable one-to-one enumerations of effective domains
• Representations versus numberings: On the relationship of two computability notions
• Effectively given domains
• On the continuity of effective multifunctions
• Semantics of algorithmic languages
• Induction and recursion on the partial real line with applications to Real PCF
• Order completion monads
• On effective topological spaces
• On the algebra of order
• Admissible representations of effective cpo's
• Theory of representations
• Effectivity and effective continuity of multifunctions
• Some results related to the continuity problem

Describes a project that uses

Uses Software

• LCF

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

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