Skip Navigation


Journal of Logic and Computation Advance Access originally published online on February 16, 2007
Journal of Logic and Computation 2008 18(2):229-238; doi:10.1093/logcom/exm001
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/2/229    most recent
exm001v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hindley, J. R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

M. H. Newman's Typability Algorithm for Lambda-calculus

J. Roger Hindley

Mathematics Department, Swansea University, Swansea SA2 8PP, UK.

E-mail: j.r.hindley{at}swan.ac.uk

Received 30 January 2006.


  Abstract

This article is essentially an extended review with historical comments. It looks at an algorithm published in 1943 by M. H. A. Newman, which decides whether a lambda-calculus term is typable without actually computing its principal type. Newman's algorithm seems to have been completely neglected by the type-theorists who invented their own rather different typability algorithms over 15 years later.

Keywords: Newman; typable; stratified; lambda-calculus; typability algorithm


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.