What is Gradual Typing | Jeremy Siek
(For a Japanese translation, go here) Gradual typing is a type system I developed with Walid Taha in 2006 that allows parts of a program to be dynamically typed and other parts to be statically typed. The programmer controls which parts are which by either leaving out type annotations or by adding them in. This article gives a gentle introduction to gradual typing. The following were our motivatio
IU Webmaster redirect
The contents you are looking for have moved. You will be redirected to the new location automatically. Please bookmark the correct page at http://homes.soic.indiana.edu/jsiek/
Dependent type - Wikipedia
In computer science and logic, a dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and type systems. In intuitionistic type theory, dependent types are used to encode logic's quantifiers like "for all" and "there exists". In functional programming languages like Agda, ATS, Coq, F*, Epigram, Idris, and Lean, dependent types help reduce bugs by
Amazon.co.jp: Advanced Topics in Types and Programming Languages (Mit Press): Pierce, Benjamin C.: 本
Type Theory and Functional Programming
Simon Thompson ISBN 0-201-41667-0, Addison-Wesley, 1991. This is now out of print. I had hoped to prepare a revised version before making it available online, but sadly this hasn't happened. So, you can get the original version, warts and all, from CafePress or free from here. Any errata will be gratefully received and added to the list below. Preface (html) Contents and Introduction (PostScript)
Omega - Language of the Future | Lambda the Ultimate
When I discovered Tim Sheard's Languages of the Future, I realized that PLs do indeed have a future (beyond asymptotically approaching CLOS and/or adding whimsical new rules to your type checker). Compared to languages like Lisp, pre-generics Java, and Python, the "futuristic" languages like Haskell and O'Caml seemed to mainly offer additional static verification, and some other neat patterns, but
Dependent type - HaskellWiki
The concept of dependent types General Wikipedia Dependent Types in Programming abstract in APPSEM'2000 Do we need dependent types? by Daniel Fridlender and Mia Indrika, 2001. Type theory Simon Thompson: Type Theory and Functional Programming. Section 6.3 deals with dependent types, but because of the strong emphasis on Curry-Howard isomorphism and the connections between logic and programming, th
Type system - Wikipedia
This article is about type systems in computer programming. For the formal study of type systems, see Type theory. This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (October 2010) (Learn how and when to remove this template message) This article is written like a per
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Gradual Typing for Functional Languages | Lambda the Ultimate
ラムダ計算入門
Types and Programming Languages
Curry–Howard correspondence - Wikipedia
Notes on Dependent Types
Adding Type Constructor Parameterization to Java | Lambda the Ultimate