• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Gradual Typing for Functional Languages (2006)

Cached

  • Download as a PDF

Download Links

  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [ecee.colorado.edu]
  • [ecee.colorado.edu]
  • [ece-www.colorado.edu]
  • [ece-www.colorado.edu]
  • [ece.colorado.edu]
  • [ece.colorado.edu]
  • [scheme2006.cs.uchicago.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jeremy G. Siek , Walid Taha
Venue:IN SCHEME AND FUNCTIONAL PROGRAMMING WORKSHOP
Citations:40 - 7 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Siek06gradualtyping,
    author = {Jeremy G. Siek and Walid Taha},
    title = {Gradual Typing for Functional Languages},
    booktitle = {IN SCHEME AND FUNCTIONAL PROGRAMMING WORKSHOP},
    year = {2006},
    pages = {81--92},
    publisher = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Static and dynamic type systems have well-known strengths and weaknesses, and each is better suited for different programming tasks. There have been many efforts to integrate static and dynamic typing and thereby combine the benefits of both typing disciplines in the same language. The flexibility of static typing can be improved by adding a type Dynamic and a typecase form. The safety and performance of dynamic typing can be improved by adding optional type annotations or by performing type inference (as in soft typing). However, there has been little formal work on type systems that allow a programmer-controlled migration between dynamic and static typing. Thatte proposed Quasi-Static Typing, but it does not statically catch all type errors in completely annotated programs. Anderson and Drossopoulou defined a nominal type system for an object-oriented language with optional type annotations. However, developing a sound, gradual type system for functional languages with structural types is an open problem. In this paper

Citations

874 A theory of type polymorphism in programming - Milner - 1978
585 Isabelle/HOL: A Proof Assistant for Higher-Order Logic - Nipkow, Paulson, et al. - 2002
580 Types and Programming Languages - Pierce - 2002
466 Featherweight Java: a minimal core calculus for Java and GJ - Igarashi, Pierce, et al. - 2001
332 Types, abstraction and parametric polymorphism - Reynolds - 1983
323 Principal type-schemes for functional programs - Damas, Milner - 1982
252 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
221 Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
175 Soft typing - Cartwright, Fagan - 1991
163 Unboxed objects and polymorphic typing - Leroy - 1992
148 Dynamic typing in a statically typed language - Abadi, Cardelli, et al. - 1991
148 Call-by-name, call-by-value and the lambda-calculus - Plotkin
130 The principal type-scheme of an object in combinatory logic - Hindley - 1969
96 Hybrid type checking - Flanagan - 2006
84 Contracts for higher-order functions - Findler, Felleisen - 2002
74 Strongtalk: Typechecking Smalltalk in a production environment - Bracha, Griswold - 1993
69 Trust and partial typing in open systems of mobile agents - Riely, Hennessy - 1998
63 Flexible representation analysis - Shao - 1997
56 G.: Eliminating covert flows with minimum typings - Volpano, Smith - 1997
48 Quasi-static typing - Thatte - 1990
47 Pluggable type systems - Bracha - 2004
44 Dynamic typing: syntax and proof theory - Henglein - 1994
41 The Dylan Reference Manual: The Definitive Guide to the New Object-Oriented Dynamic Language - Shalit, Moon, et al. - 1996
38 A virtual class calculus - Ernst, Ostermann, et al. - 2006
38 Structured Proofs in Isar/HOL - Nipkow - 2003
33 The Lambda Calculus, volume 103 - Barendregt - 1984
29 Static typing where possible, dynamic typing when needed: The end of the cold war between programming languages, 2004. http://research.microsoft.com/ en-us/um/people/emeijer/Papers/ RDL04Meijer.pdf - Meijer, Drayton
28 The Isabelle/Isar Reference Manual - Wenzel - 2002
26 Sage: Hybrid Checking for Flexible Specifications - Gronski, Knowles, et al. - 2006
18 Finegrained interoperability through mirrors and contracts - Gray, Findler, et al. - 2005
17 the Cecil Group. The Cecil Language: Specification and Rationale, Version 3.1 - Chambers - 2002
16 BabyJ: From object based to class based programming via types - Anderson, Drossopoulou - 2003
10 Bigloo: A practical Scheme compiler - Serrano - 2007
9 Semantic casts: Contracts and structural subtyping in a nominal world - Findler, Flatt, et al. - 2004
6 Dylan Programming: An Object-Oriented and Dynamic Language - Feinberg, Keene, et al. - 1997
6 An overview of COMMON LISP - Jr - 1982
5 Eds.). Revised 5 report of the algorithmic language Scheme - Kelsey, Clinger, et al. - 1998
4 Dynamic typing with dependent types (extended abstract - Ou, Tan, et al. - 2004
3 Compiling scheme programs to .NET common intermediate language - Bres, Serpette, et al. - 2004
3 The Boo programming language. http://boo.codehaus.org, 2005 - Oliveira - 1995
3 An algorithm for inferring quasi-static types - Oliart - 1994
1 Gradual typing: Isabelle/isar formalization - Siek, Taha - 2006
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University