(Enter summary)
Abstract: Hongwei Xi
Department of Computer Science and Engineering
Oregon Graduate Institute of Science and Technology
hongwei@cse.ogi.edu
Frank Pfenning
Department of Computer Science
Carnegie Mellon University
fp@cs.cmu.edu
Abstract
We present an approach to enriching the type system of ML
with a restricted form of dependent types, where type index
objects are drawn from a constraint domain C, leading to the
DML(C) language schema. This allows specification and inference
of significantly more ... (Update)
Similar documents (at the sentence level):
67.4%: Dependent Types in Practical Programming (Extended Abstract) - Xi, Pfenning (1998)
(Correct)
11.4%: Dependent Types in Practical Programming - Xi (1998)
(Correct)
11.1%: A Schema for Adding Dependent Types to ML - Xi, Pfenning (1997)
(Correct)
Active bibliography (related documents): More All
0.4: Dependently Typed Data Structures - Xi (1999)
(Correct)
0.3: Dependently Typed Pattern Matching - Xi (2003)
(Correct)
0.3: Imperative Programming with Dependent Types (Extended Abstract) - Xi (2000)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@inproceedings{ xi99dependent,
author = "Howgwei Xi and Frank Pfenning",
title = "Dependent Types in Practical Programming",
booktitle = "Conference Record of {POPL} 99: The 26th {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages, San Antonio, Texas",
address = "New York, NY",
pages = "214--227",
year = "1999",
url = "citeseer.ist.psu.edu/article/xi99dependent.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
566
Proof-carrying code
- Necula - 1997
505
Implementing Mathematics with the Nuprl Proof Development Sy..
- Constable - 1986
434
A framework for defining logics
- Harper, Honsell et al. - 1993
291
Computational lambda-calculus and monads
- Moggi - 1989
197
Dependent Types in Practical Programming
- Xi - 1998
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen - 1993
143
The Coq proof assistant user's guide (context) - Dowek, Felty et al. - 1993
137
The design and implementation of a certifying compiler
- Necula, Lee - 1998
134
PVS: Combining specification (context) - Owre, Rajan et al. - 1996
110
Eliminating array bounds checking through dependent types
- Xi, Pfenning - 1998
81
Refinement types for ML
- Freeman, Pfenning - 1991
69
Cayenne -- a language with dependent types
- Augustsson - 1998
65
Proving the correctness of reactive systems using sized type..
- Hughes, Pareto et al. - 1996
61
Local type inference
- Pierce, Turner - 1998
53
Toward formal development of ML programs: Foundations and me..
- Sannella, Tarlecki - 1989
39
PX: A Computational Logic (context) - Hayashi, Nakano - 1988
39
Le langage Caml (context) - Weis, Leroy - 1997
21
Type inference with constrained types
- Sulzmann, Odersky et al. - 1997
18
Shape checking of array programs
- Jay, Sekanina - 1996
18
Synthesizing proofs from programs in the calculus of inducti..
- Parent - 1995
13
A proof environment for the development of group communicati..
- Kreitz, Hayden et al. - 1998
12
Dead code elimination through dependent types
- Xi - 1999
10
Indizierte Typen (context) - Zenger - 1998
8
a non-strict purely-functional programming language (context) - Hudak, Jones et al. - 1992
8
Indexed types (context) - Zenger - 1997
3
Technical Report RS (context) - Danvy - 1998
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004)
(Correct)
Compiler Verification in LF - Hannan, Pfenning (1992)
(Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC