Results 1 
4 of
4
Filter Models and Easy Terms
, 2001
"... We illustrate the use of intersection types as a tool for synthesizing models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the class of theories induced by graph models is strictly included in the class of theories induced by n ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We illustrate the use of intersection types as a tool for synthesizing models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the class of theories induced by graph models is strictly included in the class of theories induced by nonextensional lter models.
Simple easy terms
 Intersection Types and Related Systems, volume 70 of Electronic Notes in Computer Science
, 2002
"... Dipartimento di Informatica Universit`a di Venezia ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Dipartimento di Informatica Universit`a di Venezia
Collapsing Partial Combinatory Algebras
 HigherOrder Algebra, Logic, and Term Rewriting
, 1996
"... Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or recursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca's, obtained by identification of elements in a pca. We ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or recursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca's, obtained by identification of elements in a pca. We establish several facts concerning final collapses (maximal identification of elements). `En passant' we find another example of a pca that cannot be extended to a total one. 1
Problem 19
"... Abstract. A closed λterm M is easy if, for any other closed term N, the lambda theory generated by M = N is consistent, while it is simple easy if, given an arbitrary intersection type τ, one can find a suitable preorder on types which allows to derive τ for M. Simple easiness implies easiness. Th ..."
Abstract
 Add to MetaCart
Abstract. A closed λterm M is easy if, for any other closed term N, the lambda theory generated by M = N is consistent, while it is simple easy if, given an arbitrary intersection type τ, one can find a suitable preorder on types which allows to derive τ for M. Simple easiness implies easiness. The question whether easiness implies simple easiness constitutes Problem 19 in the TLCA list of open problems. In this paper we negatively answer the question providing a nonempty cor.e. (complement of a recursively enumerable) set of easy, but non simple easy, λterms. Key words: Lambda calculus, easy terms, simple easy terms, filter models 1