Types for Hereditary Head Normalizing Terms

DOI10.1007/978-3-540-78969-7_15zbMATH Open1138.68021OpenAlexW4254946955MaRDI QIDQ5458437FDOQ5458437

Authors: Makoto Tatsuta 

Publication date: 11 April 2008

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78969-7_15

Recommendations

• Infinitary intersection types as sequences. A new answer to Klop's problem
• Typing untyped \(\lambda\)-terms, or reducibility strikes again!
• (Head-)normalization of typeable rewrite systems
• Strong normalization and typability with intersection types
• scientific article; zbMATH DE number 177803

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• A filter lambda model and the completeness of type assignment
• Title not available (Why is that?)
• Infinite \(\lambda\)-calculus and types
• Infinitary lambda calculus
• Compositional characterisations of \(\lambda\)-terms using intersection types
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
• Infinitary intersection types as sequences. A new answer to Klop's problem

This page was built for publication: Types for Hereditary Head Normalizing Terms

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