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

DOI10.1093/LOGCOM/EXM001MaRDI QIDQ5385202zbMATH OpenOpenAlexFDO

Authors J. Roger Hindley

Publication date 5 May 2008

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exm001

zbMATH Keywords

lambda-calculusNewmanstratificationtypability algorithm

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Combinatory logic and lambda calculus (03B40)

Recommendations

• The correctness of Newman's typability algorithm and some of its extensions
• scientific article; zbMATH DE number 4087627
• scientific article; zbMATH DE number 2185664
• scientific article; zbMATH DE number 4051569
• On the type correctness of polymorphic -terms. II

Cited in

(4)

• The mentor of Alan Turing: Max Newman (1897--1984) as a logician
• Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
• Typability in partial applicative structures
• The correctness of Newman's typability algorithm and some of its extensions

This page was built for publication: M. H. Newman's Typability Algorithm for Lambda-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385202)