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
940 A theory of type polymorphism in programming – Robin Milner - 1978
35 On subsumption and semi-unification in feature algebras РJochen D̦rre, William C Rounds - 1989
78 A simple algorithm and proof for type inference – M Wand - 1987
364 Towards a theory of type structure – J C Reynolds - 1974
234 Principal type schemes for functional programs – L Damas, R Milner - 1982
8 Detecting looping simplifications – P Purdom - 1987
8 Computational consequences and partial solutions of a generalized unification problem – A Kfoury, J Tiuryn, P Urzyczyn - 1989
285 Interpre'tation fonctionelle et e'limination des coupures duns l'arithme'tique d'ordre supe'rieure – J-Y Girard - 1972
95 Type assignment in programming languages – L M M Damas - 1985
42 Unification and ML Type Reconstruction – Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell - 1991
15 ML typability is DEXPTIME-complete – A J Kfoury, J Tiuryn, P Urzyczyn - 1990
143 The principal type-scheme of an object in combinatory logic – J R Hindley - 1969
2 Algebraic properties of semi-unification – Fritz Henglein - 1988
6 A simple non-termination test for the Knuth-Bendix method – David A Plaisted - 1979
14 A finite termination criterion – D S Lankford, David R Musser - 1978
150 The Laws of Thought – G Boole - 1854
386 Automatically validating temporal safety properties of interfaces – Thomas Ball, Sriram K. Rajamani - 2001