Non finitely generated types and λ-terms combinatoric representation cost

DOI10.1016/S0764-4442(00)01686-4zbMath0962.03009OpenAlexW2049764522MaRDI QIDQ4522149

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

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