Polymorphic Type Inference and Semi-Unification (1989)

Cached

Download Links

by Fritz Henglein
Citations:25 - 6 self

Documents Related by Co-Citation

54 The undecidability of the semi-unification problem – A J Kfoury, J Tiuryn, P Urzyczyn - 1990
93 Polymorphic type schemes and recursive definitions – A Mycroft - 1984
939 A theory of type polymorphism in programming – Robin Milner - 1978
8 Computational consequences and partial solutions of a generalized unification problem – A Kfoury, J Tiuryn, P Urzyczyn - 1989
35 On subsumption and semi-unification in feature algebras – Jochen Dörre, William C Rounds - 1989
8 Detecting looping simplifications – P Purdom - 1987
41 P.Urcyczyn: An Analysis of ML-Typability – J Tiuryn A J Kfoury - 1990
10 On a Unification Problem related to Kreisel’s Conjecture – P Pudlák - 1988
363 Towards a theory of type structure – J C Reynolds - 1974
336 An Efficient Unification Algorithm – Alberto Martelli, Ugo Montanari - 1982
147 Linear unification – M Paterson, N Wegman - 1978
945 A machine-oriented logic based on the resolution principle – J A Robinson - 1965
288 Interpretation Fonctionelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieure – J -Y Girard - 1972
373 Interprocedural Dataflow Analysis via Graph Reachability – Thomas Reps, Mooly Sagiv, Susan Horwitz - 1994
6 Fast left-linear semi-unification – Fritz Henglein - 1990
234 Principal type schemes for functional programs – R Milner - 1982
3 A decidable case of the semi-unification problem – H Lei, F Henglein - 1991
77 A simple algorithm and proof for type inference – M Wand - 1987
15 ML typability is DEXPTIME-complete – A J Kfoury, J Tiuryn, P Urzyczyn - 1990