Type-level Computation Using Narrowing in Ωmega | Zendy

Tim Sheard | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Type-level Computation Using Narrowing in Ωmega

Author(s) -

Tim Sheard

Publication year - 2007

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.10.040

Subject(s) - mega , computation , hierarchy , computer science , reduction (mathematics) , theoretical computer science , value (mathematics) , programming language , mathematics , machine learning , geometry , economics , market economy , physics , astronomy

Ωmega is an experimental system that combines features of both a programming language and a logical reasoning system. Ωmega is a language with an infinite hierarchy of computational levels. Terms at one level are classified (or typed) by terms at the next higher level. In this paper we report on using two different computational mechanisms. At the value level, computation is performed by reduction, and is largely unconstrained. At all higher levels, computation is performed by narrowing

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