The correctness of Newman’s typability algorithm and some of its extensions
- 20 June 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (28) , 3242-3261
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- M. H. Newman's Typability Algorithm for Lambda-calculusJournal of Logic and Computation, 2007
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- The Principal Type-Scheme of an Object in Combinatory LogicTransactions of the American Mathematical Society, 1969
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- Newmak M. H. A.. Stratified systems of logic. Proceedings of the Cambridge Philosophical Society, vol. 39 (1943), pp. 69–83.The Journal of Symbolic Logic, 1944
- Stratified systems of logicMathematical Proceedings of the Cambridge Philosophical Society, 1943
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940
- New Foundations for Mathematical LogicThe American Mathematical Monthly, 1937