Easy lambda-terms are not always simple

@article{Carraro2012EasyLA,
  title={Easy lambda-terms are not always simple},
  author={A. Carraro and A. Salibra},
  journal={RAIRO Theor. Informatics Appl.},
  year={2012},
  volume={46},
  pages={291-314}
}
A closed λ -term M is easy if, for any other closed term N , the lambda theory generated by M  =  N is consistent. Recently, it has been introduced a general technique to prove the easiness of λ -terms through the semantical notion of simple easiness. Simple easiness implies easiness and allows to prove consistency results via construction of suitable filter models of λ -calculus living in the category of complete partial orderings: given a simple easy term M and an arbitrary closed term… Expand
5 Citations
Minimal lambda-theories by ultraproducts
Algebraic structures for the lambda calculus and the propositional logic
Graph easy sets of mute lambda terms
A graph-easy class of mute lambda-terms
Uniqueness typing for intersection types

References

SHOWING 1-10 OF 68 REFERENCES
Some New Results on Easy lambda-Terms
Simple Easy Terms
  • F. Alessi, S. Lusin
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 2002
Effective λ-models versus recursively enumerable λ-theories
Topological incompleteness and order incompleteness of the lambda calculus
Innite -calculus and non-sensible models
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus
  • A. Carraro, A. Salibra
  • Mathematics, Computer Science
  • 2009 24th Annual IEEE Symposium on Logic In Computer Science
  • 2009
Intersection types and domain operators
On the construction of stable models of untyped lambda-calculus
  • R. Kerth
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2001
Extended Type Structures and Filter Lambda Models
...
1
2
3
4
5
...