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. We explore the effect of recursion and the st...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1996-01, Vol.57 (1), p.9-13
1. Verfasser:	Volpano, Dennis M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computational complexity Computer languages Computer programming Computer science control theory systems Exact sciences and technology Information processing Overloading Problem solving Programming theory Studies Theoretical computing Type theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!