Partial type inference for untyped functional programs

Authors:
Carsten K. Gomard
Affiliations:
DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK - 2100 Copenhagen ø, Denmark
Venue:
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Year:
1990

Citing 9
Cited 23

Automatic binding time analysis for a typed &lgr;-calculus

Science of Computer Programming
Automatic autoprojection of higher order recursive equations

Proceedings of the third European symposium on programming on ESOP '90
Arity raiser and use in program specialization

Proceedings of the third European symposium on programming on ESOP '90
Strictness analysis: a new perspective based on type inference

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Finding the source of type errors

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic Subtype Inference: Closing the Theory-Practice Gap

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Binding Time Analysis for Polymorphically Typed Higher Order Languages

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages

Soft typing

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global tagging optimization by type inference

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Analysis of recursive types in Lisp-like languages

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Incremental partial evaluation: the key to high performance, modularity and portability in operating systems

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Polyvariant binding-time analysis for applicative languages

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A tour of Schism: a partial evaluation system for higher-order applicative languages

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Specifying the correctness of binding-time analysis

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tutorial notes on partial evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft typing with conditional types

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A staging calculus and its application to the verification of translators (preliminary report)

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical soft type system for Scheme

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Dynamic typing and subtype inference

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
A practical soft type system for scheme

ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-Order UnCurrying

Higher-Order and Symbolic Computation
Environment classifiers

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Aspects of the PGG System: Specialization for Standard Scheme

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Partial Evaluation for the Lambda Calculus

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Incremental Inference of Partial Types

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Combinators for program generation

Journal of Functional Programming
Soft typing

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Source-tracking unification

Information and Computation
Source-tracking unification

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This extended abstract describes a way of inferring as much type information as possible about programs written in an untyped programming language. We present an algorithm that underlines the untypable parts of a program and assigns types to the rest. The algorithm is derived in a very simple manner from the well-known algorithm W of Damas & Milner [Damas and Milner 1982].Our algorithm provides us with an easy solution to the problem of doing binding time analysis of the untyped higher order lambda calculus, and thereby of the wide range of programming languages based upon the lambda calculus. The techniques can also be used to eliminate superfluous runtime type checking in untyped functional languages, to produce better error messages from type analyzers for strongly typed languages, and to analyze feasibility of arity raising.