Dependent ML An approach to practical programming with dependent types

Authors:
Hongwei Xi
Affiliations:
Computer Science Department, Boston University, Boston, MA, USA (e-mail: hwxi@cs.bu.edu)
Venue:
Journal of Functional Programming
Year:
2007

Citing 43
Cited 13

Constructive mathematics and computer programming

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
An introduction to mathematical logic and type theory: to truth through proof

An introduction to mathematical logic and type theory: to truth through proof
Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
PX: a computational logic

PX: a computational logic
A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement types for ML

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Eliminating false data dependences using the Omega test

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Design and implementation of practical constraint logic programming systems

Design and implementation of practical constraint logic programming systems
A simplified account of polymorphic references

Information Processing Letters
Experiences with constraint-based array dependence analysis

Experiences with constraint-based array dependence analysis
Parallel reductions in &lgr;-calculus

Information and Computation
Simple imperative polymorphism

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Indexed types

Theoretical Computer Science - Special volume on computer algebra
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Purely functional data structures

Purely functional data structures
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
On the SUP-INF Method for Proving Presburger Formulas

Journal of the ACM (JACM)
Colored local type inference

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Definition of Standard ML

The Definition of Standard ML
Guarded recursive datatype constructors

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions

MPC '95 Mathematics of Program Construction
A Proof Environment for the Development of Group Communication Systems

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Continuation Semantics in Typed Lambda-Calculi (Summary)

Proceedings of the Conference on Logic of Programs
Implementing typeful program transformations

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Dependent types in practical programming

Dependent types in practical programming
Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Manufacturing datatypes

Journal of Functional Programming
Red-black trees with types

Journal of Functional Programming
Functional unparsing

Journal of Functional 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
A language-based approach to functionally correct imperative programming

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Meta-programming through typeful code representation

Journal of Functional Programming
Stratified type inference for generalized algebraic data types

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementing Typeful Program Transformations

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Type assignment for intersections and unions in call-by-value languages

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Many holes in hindley-milner

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Algebra of Programming Using Dependent Types

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
An integrated proof language for imperative programs

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Algebra of programming in agda: Dependent types for relational program derivation

Journal of Functional Programming
Operating system development with ATS: work in progress

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Attributive types for proof erasure

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Ur: statically-typed metaprogramming with type-level record computation

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Regular, shape-polymorphic, parallel arrays in Haskell

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Language-based verification will change the world

Proceedings of the FSE/SDP workshop on Future of software engineering research
The essence of monotonic state

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Maintaining database integrity with refinement types

Proceedings of the 25th European conference on Object-oriented programming
HALO: haskell to logic through denotational semantics

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A linear type system for multicore programming in ATS

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index terms are required to be drawn from a given type index language ${\cal L}$ that is completely separate from run-time programs, leading to the DML(${\cal L}$) language schema. This enrichment allows for specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. The primary contribution of the paper lies in our language design, which can effectively support the use of dependent types in practical programming. In particular, this design makes it both natural and straightforward to accommodate dependent types in the presence of effects such as references and exceptions.