Axiomatization of computationally adequate domain theoretic models of FPC

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1994, Pages 92-102

  Fiore, Marcelo P ^a   Plotkin, Gordon D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; EQUIVALENCE CLASSES; FUNCTION EVALUATION; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

AXIOMATIC CATEGORICAL DOMAIN THEORY; AXIOMATIZATION; COMPUTATIONALLY ADEQUATE DOMAIN THEORETIC MODELS; DENOTATIONAL SEMANTICS; METALANGUAGE FPC; SYNTHETIC DOMAIN THEORY;

FORMAL LANGUAGES;

EID: 0027929035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)