Characterization theorems for a filter lambda model

DOI10.1016/S0019-9958(82)80022-3zbMath0513.03008OpenAlexW2089262705MaRDI QIDQ3657969

Simonetta Ronchi della Rocca

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)80022-3

zbMATH Keywords

completeness prooflambda modelsyntactical characterizationfunctionality theory of Curry

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (8)

Principal type scheme and unification for intersection type discipline ⋮ Intersection and union types ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Intersection types for combinatory logic ⋮ Types with intersection: An introduction ⋮ Intersection types for \(\lambda\)-trees ⋮ Unnamed Item ⋮ Infinite \(\lambda\)-calculus and types

This page was built for publication: Characterization theorems for a filter lambda model