Non finitely generated types and λ-terms combinatoric representation cost

DOI10.1016/S0764-4442(00)01686-4zbMATH Open0962.03009OpenAlexW2049764522MaRDI QIDQ4522149FDOQ4522149

Authors: T. Joly 

Publication date: 19 March 2001

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0764-4442(00)01686-4

Recommendations

• scientific article; zbMATH DE number 1808200
• Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
• scientific article; zbMATH DE number 992007
• scientific article; zbMATH DE number 1759417
• Compositional characterisations of \(\lambda\)-terms using intersection types
• The complexity of type inference for higher-order typed lambda calculi
• scientific article; zbMATH DE number 4072354
• Expressing computational complexity in constructive type theory
• Non-idempotent intersection types for the lambda-calculus
• Efficiency of lambda-encodings in total type theory

zbMATH Keywords

pure \(\lambda\)-calculussimply typed \(\lambda\)-calculusrepresentation of \(\lambda\)-terms from combinators

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (3)

• How many numbers can a lambda-term contain?
• Title not available (Why is that?)
• A characterization of lambda-terms transforming numerals

This page was built for publication: Non finitely generated types and λ-terms combinatoric representation cost

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