An Operational Domain-theoretic Treatment of Recursive Types | Zendy

Weng Kin Ho | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Operational Domain-theoretic Treatment of Recursive Types

Author(s) -

Weng Kin Ho

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.04.013

Subject(s) - domain theory , equivalence (formal languages) , mathematics , domain (mathematical analysis) , operational semantics , property (philosophy) , algebra over a field , type theory , theoretical computer science , compact space , inverse , algebraic number , principal (computer security) , computer science , type (biology) , semantics (computer science) , discrete mathematics , pure mathematics , programming language , mathematical analysis , ecology , philosophy , geometry , epistemology , biology , operating system

We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we do not produce the recursive types via the usual inverse limits constructions - we have it for free by working directly with the operational semantics. By extending type expressions to endofunctors on a 'syntactic' category, we establish algebraic compactness. To do this, we rely on an operational version of the minimal invariance property. In addition, we apply techniques developed herein to reason about FPC programs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research