Logical types for untyped languages

ACM SIGPLAN Notices

Volumn 45, Issue 9, 2010, Pages 117-128

  Tobin Hochstadt, Sam ^a   Felleisen, Matthias ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Logic; Type systems; Untyped languages

Indexed keywords

LOGIC; ORIGINAL SYSTEMS; PRACTICAL EXPERIENCE; PROGRAMMING IDIOMS; PROOF SYSTEM; PROPOSITIONAL LOGIC; REASONING METHODS; TYPE SYSTEMS; UNTYPED LANGUAGES;

DATA STRUCTURES;

FORMAL LOGIC;

EID: 79551669088     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1932681.1863561     Document Type: Conference Paper

References (31)

1. A. Aiken, E. L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In Proc. 21st Symposium on Principles of Programming Languages, pages 163-173. ACM Press, 1994.
2. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development, volume XXV of EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2004.
3. G. M. Bierman, A. D. Gordon, C. Hricu, and D. Langworthy. Semantic subtyping with an SMT solver. In Proc. Fifteenth International Conference on Functional Programming. ACM Press, 2010.
4. R. Cartwright. User-defined data types as an aid to verifying LISP programs. In International Conference on Automata, Languages and Programming, pages 228-256, 1976.
5. K. Crary, S. Weirich, and G. Morrisett. Intensional polymorphism in type-erasure semantics. In Proc. Third International Conference on Functional Programming, pages 301-312. ACM Press, 1998.
6. H. Curry and R. Feys. Combinatory Logic, volume I. North-Holland, 1958.
7. ECMA. ECMAScript Edition 4 group wiki, 2007. URL http://wiki.ecmascript. org/.
8. M. Felleisen, R. B. Findler, M. Flatt, and S. Krishnamurthi. How to Design Programs. MIT Press, 2001. URL http://www.htdp.org/.
9. C. Flanagan and M. Felleisen. Componential set-based analysis. ACM Trans. Progr. Lang. Sys., 21(2):370-416, 1999.
10. M. Flatt and PLT. Reference: Racket. Reference Manual PLT-TR2010-1, PLT Scheme Inc., June 2010. http://racket-lang.org/techreports/.
11. M. Furr, J.-H. D. An, J. S. Foster, and M. Hicks. Static type inference for ruby. In SAC'09: Proc. 2009 ACM Symposium on Applied Computing, pages 1859-1866. ACM Press, 2009.
12. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL (T): Fast Decision Procedures. In 16th International Conference on Computer Aided Verification, CAV'04, volume 3114 of Lecture Notes in Computer Science, pages 175-188. Springer-Verlag, 2004.
13. F. Henglein. Dynamic typing: Syntax and proof theory. Sci. Comput. Programming, 22(3):197-230, 1994.
14. F. Henglein and J. Rehof. Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML. In Proc. Seventh International Conference on Functional Programming Languages and Computer Architecture, pages 192-203. ACM Press, 1995.
15. W. A. Howard. The formulas-as-types notion of construction. In J. P. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pages 479-490. Academic Press, 1980.
16. R. Komondoor, G. Ramalingam, S. Chandra, and J. Field. Dependent types for program understanding. In Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 157-173. Springer-Verlag, 2005.
17. J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Proc. 15th Symposium on Principles of Programming Languages, pages 47-57. ACM Press, 1988.
18. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004.
19. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.
20. S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proc. Eleventh International Conference on Functional Programming, pages 50-61. ACM Press, 2006.
21. B. C. Pierce and D. N. Turner. Local type inference. ACM Trans. Progr. Lang. Sys., 22(1):1-44, 2000.
22. J. C. Reynolds. Automatic computation of data set definitions. In IFIP Congress (1), pages 456-461, 1968.
23. O. Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1991.
24. J. G. Siek and W. Taha. Gradual typing for functional languages. In Seventh Workshop on Scheme and Functional Programming, University of Chicago Technical Report TR-2006-06, pages 81-92, September 2006.
25. V. Simonet and F. Pottier. A constraint-based approach to guarded algebraic data types. ACM Trans. Progr. Lang. Sys., 29(1):1-54, 2007.
26. S. Thatte. Quasi-static typing. In Proc. 17th Symposium on Principles of Programming Languages, pages 367-381. ACM Press, 1990.
27. S. Tobin-Hochstadt and M. Felleisen. The design and implementation of Typed Scheme. In Proc. 35th Symposium on Principles of Programming Languages, pages 395-406. ACM Press, 2008.
28. D. Vytiniotis, S. Peyton Jones, and T. Schrijvers. Let should not be generalized. In TLDI'10: Proc. 5th workshop on Types in language design and implementation, pages 39-50. ACM Press, 2010.
29. P. Wadler and R. B. Findler. Well-typed programs can't be blamed. In ESOP'09: Proc. Eighteenth European Symposium on Programming, volume 5502 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2009.
30. A. K. Wright and R. Cartwright. A practical soft type system for Scheme. ACM Trans. Progr. Lang. Sys., 19(1):87-152, 1997.
31. T. Wrigstad, F. Z. Nardelli, S. Lebresne, J. Östlund, and J. Vitek. Integrating typed and untyped code in a scripting language. In Proc. 37th Symposium on Principles of Programming Languages, pages 377-388. ACM Press, 2010.