On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
A syntactic approach to type soundness
Information and Computation
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
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
MetaML and multi-stage programming with explicit annotations
Theoretical Computer Science - Partial evaluation and semantics-based program manipulation
A type system for certified binaries
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Tagless staged interpreters for typed languages
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Template meta-programming for Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
A lightweight implementation of generics and dynamics
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Tag Elimination and Jones-Optimality
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
A Finite Axiomatization of Inductive-Recursive Definitions
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Refinement-Type Checker for Standard ML
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Inductive Definitions and Type Theory: an Introduction (Preliminary Version)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the Third International Conference on Algebraic and Logic Programming
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Dependent types in practical programming
Dependent types in practical programming
Combining programming with theorem proving
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Program logics for homogeneous meta-programming
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Adjoint folds and unfolds-An extended study
Science of Computer Programming
Combining proofs and programs in a dependently typed language
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
This report was originally prepared as notes for a short courseon Ωmega taught at the Central-European FunctionalProgramming School held in Cluj, Romania, between 25-30 June, 2007.It can be viewed as a tutorial on the use of theΩmega programming language.It introduces readers to the types as propositionsnotion based upon the Curry-Howard isomorphism. Such types canexpress precise properties of programs. The Ωmegalanguage allows us to use a single language for the specificationof designs, the definition of properties, the implementation ofprograms, and the production of proofs that programs adhere totheir properties. Ωmega bundles all these in acoherent manner into a single unified system that appears to theuser to be a programming language.