Lower Bounds on Type Checking Overloading

Lower Bounds on Type Checking Overloading

Smith has proposed an elegant extension of the ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. This short note explores the effect of recurs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Volpano, Dennis M
Format: Report
Sprache:eng
Schlagworte:
COMPUTATIONAL COMPLEXITY
COMPUTATIONS
Computer Programming and Software
OVERLOADING
POLYMORPHISM
PROGRAMMING LANGUAGES
RECURSIVE FUNCTIONS
THEORY
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Smith has proposed an elegant extension of the ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. This short note explores the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.