Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

GI
1999
Springer

favoriteEmaildiscussreport

91views Theoretical Computer Science» more GI 1999»

Combining Strict and Soft Typing in Functional Programming

13 years 8 months ago

Combining Strict and Soft Typing in Functional Programming

Download www.fernuni-hagen.de

We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept every well-typed program. The main component of a complete type checker is deﬁned.

Manfred Widera, Christoph Beierle

Real-time Traffic

GI 1999 | Powerful Type Languages | Soft Typing | Theoretical Computer Science | Type Checking |

claim paper

Related Content

» Implementing a NonStrict Functional Programming Language on a Threaded Architecture

» Taming Selective Strictness

» How Much NonStrictness do Lenient Programs Require

» Strictness totality and nonstandardtype inference

» Rewriting Haskell Strings

» Making stricterness more relevant

» Hybrid tractability of soft constraint problems

» Declarative Programming with Function Patterns

» Detecting common elements of types

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	GI
Authors	Manfred Widera, Christoph Beierle

Comments (0)