Structure and interpretation of computer programs
Structure and interpretation of computer programs
Partial type inference for untyped functional programs
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Type inference with recursive types: syntax and semantics
Information and Computation
Type inference for partial types is decidable
ESOP'92 Symposium proceedings on 4th European symposium on programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient inference of partial types
Journal of Computer and System Sciences
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coinductive axiomatization of recursive type equality and subtyping
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Lambda-Definition of Function(al)s by Normal Forms
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Type Inference with Partial Types
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Equational term graph rewriting
Equational term graph rewriting
Calculi, types and applications
Theoretical Computer Science
| Hi-index | 0.00 |
We present a type inference procedure with partial types for a 驴-calculus equipped withda tatypes. Our procedure handles a type language containing greatest and least types (驴 and 驴 respectively), recursive types, subtyping, and datatypes (yielding constants at the level of terms). The main feature of our algorithm is incrementality; this allows us to progressively analyse successive definitions, which is of interest in the setting of a system like the CuCh machine (developed at the University of Rome). The methods we describe have led to an implementation; we illustrate its use on a few examples.