scientific article; zbMATH DE number 3907754
[For the entire collection see Zbl 0566.00026.] Polymorphic type systems as proposed by Milner and implemented in the programming language ML offer rich types, unobtrusive compile-time type-cheking, and complete type-safety in functional languages. However, straightforward addition of such a type system to languages with interactive environments such as FQL, SASL or Scheme can inhibit seriously the top-down, incremental programming style characteristically employed with them. The problems include error-recovery during type-checking, type-checking with incomplete information and incremental type-checking during program development. We describe these problems and present an integrated solution as prototyped in FQL.
- A sound polymorphic type system for a dialect of \(C\)
- Incremental polymorphic type checking with update
- Parametric Polymorphism — Universally
- scientific article; zbMATH DE number 4013997 (Why is no real title available?)
- scientific article; zbMATH DE number 3874579 (Why is no real title available?)
- Algorithm of construction of a type and its realization in the language W
- Bunched polymorphism
- Practical Variable-Arity Polymorphism
- scientific article; zbMATH DE number 3951980 (Why is no real title available?)
- Polymorphic programming I. Another language designed on semantic principles
- A polymorphic modal type system for Lisp-like multi-staged languages
- A functional shell that dynamically combines compiled code
- A Compilation Method for Dynamic Typing in ML
- Polymorphic types in ACL2
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685176)