(Enter summary)
Abstract: In this paper, we enrich imperative programming with a form of dependent types. We start
with explaining some motivations for this enrichment and mentioning some major obstacles that
need to be overcome. We then present the design of a source level dependently typed imperative
programming language Xanadu, forming both static and dynamic semantics and then establishing
the type soundness theorem. We also present realistic programming examples in support of the
practicality of Xanadu. We... (Update)
Cited by: More
A Formulation of Dependent ML with Explicit Equality Proofs - Licata, Harper (2005)
(Correct)
Typed Stateful Programming - Zhu (2004)
(Correct)
Applied Type System with Stateful Views - Hongwei Xi Dengping
(Correct)
Similar documents (at the sentence level):
37.2%: Imperative Programming with Dependent Types (Extended Abstract) - Xi (2000)
(Correct)
Active bibliography (related documents): More All
0.4: Dependently Typed Data Structures - Xi (1999)
(Correct)
0.3: Facilitating Program Verification with Dependent Types - Xi (2000)
(Correct)
0.2: Dependently Typed Pattern Matching - Hongwei Xi Computer (2003)
(Correct)
Similar documents based on text: More All
0.8: Hurdles on the Highway: Are we Ready for Xanadu? - Jewell (2001)
(Correct)
0.6: A Dependently Typed Assembly Language - Xi, Harper (2001)
(Correct)
0.3: Higher-Order Transformation of Logic Programs - Seres, Spivey (2000)
(Correct)
Related documents from co-citation: More All
20: Dependent types in practical programming
- Xi, Pfenning - 1999
9: Eliminating array bound checking through dependent types
- Xi, Pfenning - 1998
7: Enforcing high-level protocols in low-level software
- ahndrich, DeLine - 2001
BibTeX entry: (Update)
H. Xi. Imperative Programming with Dependent Types. In Proceedings of 15th IEEE Symposium on Logic in Computer Science, pages 375-387, June 2000. http://citeseer.ist.psu.edu/article/xi00imperative.html More
@inproceedings{ xi00imperative,
author = "Hongwei Xi",
title = "Imperative Programming with Dependent Types",
booktitle = "Logic in Computer Science",
pages = "375-387",
year = "2000",
url = "citeseer.ist.psu.edu/article/xi00imperative.html" }
Citations (may not include all citations):
566
Proof-carrying code
- Necula - 1997
236
Intuitionistic Type Theory (context) - of - 1984
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
197
Dependent Types in Practical Programming
- Xi - 1998
197
Dependent types in practical programming
- Xi, Pfenning - 1999
137
The design and implementation of a certifying compiler
- Necula, Lee - 1998
110
Eliminating array bound checking through dependent types
- Xi, Pfenning - 1998
56
An overview of the extended static checking system
- Detlefs - 1996
32
A Dependently Typed Assembly Language
- Xi, Harper - 1999
15
Renement types for ML (context) - Freeman, Pfenning - 1991
12
Dead code elimination through dependent types
- Xi
8
Indexed types (context) - Zenger - 1997
6
Xanadu: Imperative Programming with Dependent Types (context) - Xi
3
Some Practical Aspects of Dependent Datatypes
- Xi
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ececs.uc.edu/~hwxi/): More
Imperative Programming with Dependent Types (Extended Abstract) - Xi (2000)
(Correct)
Facilitating Program Verification with Dependent Types - Xi (2000)
(Correct)
Dependently Typed Data Structures - Xi (1999)
(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