Type-level Computation Using Narrowing in Ωmega

Authors:
Tim Sheard
Affiliations:
Computer Science Department, Portland State University, Portland, OR. USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 17
Cited 8

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Intensional polymorphism in type-erasure semantics

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding type equivalence in a language with singleton kinds

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for certified binaries

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement-Type Checker for Standard ML

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Narrowing the Narrowing Space

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Inductive Definitions and Type Theory: an Introduction (Preliminary Version)

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Dependent types in practical programming

Dependent types in practical programming
Languages of the future

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Combining programming with theorem proving

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Putting curry-howard to work

Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Evaluation strategies for functional logic programming

Journal of Symbolic Computation

Type checking with open type functions

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Generics of a higher kind

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Verified programming in Guru

Proceedings of the 3rd workshop on Programming languages meets program verification
Functional logic programming

Communications of the ACM
Programming with narrowing: A tutorial

Journal of Symbolic Computation
Termination of narrowing in left-linear constructor systems

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Giving Haskell a promotion

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Abstract refinement types

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

@Wmega is an experimental system that combines features of both a programming language and a logical reasoning system. @Wmega 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.