(Enter summary)
Abstract: Traditional static type systems in the Hindley-Milner style are a useful means of guaranteeing
type safety, in the form of type preservation and progress theorems, and of broadly
specifying properties of functions (such as taking integers to lists of integers). In order to allow
programmers to express stronger properties through static typing, I propose to develop
and implement a rich type system that combines and extends work on datasort refinements,
index refinements, intersection, and... (Update)
Active bibliography (related documents): More All
0.1: C∀, a Study in Evolutionary Design in Programming Languages - Jaramillo (2004)
(Correct)
0.1: Safe Programming at the C Level of Abstraction - Grossman (2003)
(Correct)
0.1: The K combinator as a semantically transparent tagging mechanism - Slind, Norrish (2002)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@misc{ of-thesis,
author = "Unifying Principles Of",
title = "Thesis Proposal:",
url = "citeseer.ist.psu.edu/751897.html" }
Citations (may not include all citations):
157
Soft typing with conditional types
- Aiken, Wimmers et al. - 1994
86
Implementing Mathematics with the Nuprl Development System (context) - Constable, Allen et al. - 1986
69
Cayenne---a language with dependent types
- Augustsson - 1998
54
Functional characters of solvable terms (context) - Coppo, Dezani-Ciancaglini et al. - 1981
47
Intersection and union types: syntax and semantics (context) - Barbanera, Dezani-Ciancaglini et al. - 1995
9
No-longer-foreign: Teaching an ML compiler to speak C
- Blume - 2001
http://caml.inria.fr
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