On uniquely closable and uniquely typable skeletons of lambda terms

DOI10.1007/978-3-319-94460-9_15OpenAlexW2962756481MaRDI QIDQ1671157

Paul Tarau, Olivier Bodini

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1709.04302

zbMATH Keywords

computational mathematicslogic programmingcombinatorics of lambda termsefficient logic programsinferring simple typesuniquely closable lambda term skeletonsuniquely typable lambda term skeletons

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Unnamed Item ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Statistical properties of lambda terms

This page was built for publication: On uniquely closable and uniquely typable skeletons of lambda terms