Typeful programming

Typeful programming

In computer science typeful programming is a programming style identified by widespread use of type information handled through mechanical typechecking techniques. The concept was introduced in a scientific paper of the same name published by Luca Cardelli in 1991.

Haskell, the functional programming language, is said to be typeful. [Luca Cardelli. "Typeful programming". In E. J. Neuhold and M. Paul, editors, "FormalDescription of Programming Concepts", IFIP State-of-the-Art Reports, pages 431–507. Springer-Verlag, New York, 1991.]

References

External links

* [http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-045.html SRC Research Report 45 - Typeful Programming] The scientific paper introducing the concept of typeful programming


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Strongly-typed programming language — In computer science and computer programming, the term strong typing is used to describe those situations where programming languages specify one or more restrictions on how operations involving values having different data types can be… …   Wikipedia

  • Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …   Wikipedia

  • Many-sorted logic — can reflect formally our intention, not to handle the universe as a homogeneous collection of objects, but to partition it in a way that is similar to types in typeful programming. Both functional and assertive parts of speech in the language of… …   Wikipedia

  • Luca Cardelli — is an Italian computer scientist who is currently an Assistant Director at Microsoft Research in Cambridge, UK. Cardelli is well known for his research in type theory and operational semantics. Among other contributions he implemented the first… …   Wikipedia

  • Zipper (data structure) — Zipper is a purely functional data structure used in functional programming to solve some problems in a way using notions like “context” and “hole”. It is related to the generalization of notion “derivative” (for types). The zipper was described… …   Wikipedia

  • Derivative (generalizations) — Derivative is a fundamental construction of differential calculus and admits many possible generalizations within the fields of mathematical analysis, combinatorics, algebra, and geometry. Derivatives in analysis In real, complex, and functional… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”