Electronic Notes in Theoretical Computer Science · 2003 · 13 citations · 18 references
ComputingComputer ScienceMathematicsAlgebraFormal MethodsSemanticsAbstract InterpretationModel TheorySyntax-semantics InterfaceType SystemsIntersectionIntersection TheoremsIntersection Types
We illustrate the use of intersection types as a semantic tool for proving easiness result on λ-terms. We single out the notion of simple easiness for λ-terms as a useful semantic property for building filter models with special purpose features. Relying on the notion of easy intersection type theory, given λ-terms M and E, with E simple easy, we successfully build a filter model which equates interpretation of M and E, hence proving that simple easiness implies easiness. We finally prove that a class of λ-terms generated by ω2ω2 are simple easy, so providing alternative proof of easiness for them.
18
Full Abstraction in the Lazy Lambda Calculus
Samson Abramsky, C.-H. Luke Ong · Information and Computation · 1993 · 238 citations
Lambda‐Calculus Models and Extensionality
Roger Hindley, G. Longo · Mathematical logic quarterly · 1980 · 118 citations