S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

A. Asperti and G. Longo, Categories, types and structures: an introduction to category theory for the working computer scientist, 1991.

H. P. Barendregt, The lambda calculus: its syntax and semantics. North-Holland, 1984.

O. Bastonero, Modèles fortement stables du ?-calcul et résultats d'incomplétude, Thèse de Doctorat, 1996.

O. Bastonero and X. Gouy, Strong stability and the incompleteness of stable models for ??-calculus, Annals of Pure and Applied Logic, vol.100, issue.1-3, pp.247-277, 1999.
DOI : 10.1016/S0168-0072(99)00015-9

S. Berardi and C. Berline, ????-complete models for System F, Mathematical Structures in Computer Science, vol.12, issue.06, pp.823-874, 2002.
DOI : 10.1017/S0960129502003778

C. Berline, From computation to foundations via functions and application: The ??-calculus and its webbed models, Theoretical Computer Science, vol.249, issue.1, pp.81-161, 2000.
DOI : 10.1016/S0304-3975(00)00057-8

C. Berline, Graph models of $\lambda$-calculus at work, and variations, Mathematical Structures in Computer Science, vol.16, issue.02, pp.1-37, 2006.
DOI : 10.1017/S0960129506005123
URL : https://hal.archives-ouvertes.fr/hal-00004473

C. Berline, G. Manzonetto, and A. Salibra, Effective lambda models versus recursively enumerable lambda theories, Mathematical Structures in Computer Science

C. Berline, G. Manzonetto, and A. Salibra, Lambda Theories of Effective Lambda Models, Proc. 16th EACSL Annual Conference on Computer Science and Logic (CSL'07), pp.268-282, 2007.
DOI : 10.1007/978-3-540-74915-8_22
URL : https://hal.archives-ouvertes.fr/hal-00125816

G. Berry, Stable models of typed lambda-calculi, Proceedings of the Fifth Colloquium on Automata, Languages and Programming, 1978.

G. Berry, P. Curien, and J. Lévy, Full Abstraction for sequential languages: the state of the art, Algebraic Methods in Semantics, pp.89-132, 1985.

A. Bucciarelli and T. Ehrhard, Sequentiality and strong stability, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.138-145, 1991.
DOI : 10.1109/LICS.1991.151638

A. Bucciarelli and T. Ehrhard, On phase semantics and denotational semantics: the exponentials, Annals of Pure and Applied Logic, vol.109, issue.3, pp.205-241, 2001.
DOI : 10.1016/S0168-0072(00)00056-7
URL : https://hal.archives-ouvertes.fr/hal-00527042

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, Not Enough Points Is Enough, Proc. 16th EACSL Annual Conference on Computer Science and Logic (CSL'07), pp.298-312, 2007.
DOI : 10.1007/978-3-540-74915-8_24
URL : https://hal.archives-ouvertes.fr/hal-00148820

A. Bucciarelli and A. Salibra, The sensible graph theories of lambda calculus, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.276-285, 2004.
DOI : 10.1109/LICS.2004.1319622
URL : https://hal.archives-ouvertes.fr/hal-00149558

A. Bucciarelli and A. Salibra, Graph lambda theories, Mathematical Structures in Computer Science, vol.45, issue.05, pp.975-1004, 2008.
DOI : 10.1016/0022-0000(92)90040-P
URL : https://hal.archives-ouvertes.fr/hal-00149556

S. Burris and H. P. Sankappanavar, A course in universal algebra, 1981.
DOI : 10.1007/978-1-4613-8130-3

A. Church, A Set of Postulates for the Foundation of Logic, The Annals of Mathematics, vol.33, issue.2, pp.346-366, 1932.
DOI : 10.2307/1968337

S. Comer, Representations by algebras of sections over Boolean spaces, Pacific Journal of Mathematics, vol.38, issue.1, pp.29-38, 1971.
DOI : 10.2140/pjm.1971.38.29

M. Dezani-ciancaglini, U. De-'liguoro, and A. Piperno, A Filter Model for Concurrent $\lambda$-Calculus, SIAM Journal on Computing, vol.27, issue.5, pp.1376-1419, 1998.
DOI : 10.1137/S0097539794275860

P. , D. Gianantonio, G. Franco, and F. Honsell, Game semantics for untyped lambda calculus, Proc. of the conference Typed Lambda Calculus and Applications

P. , D. Gianantonio, F. Honsell, and G. Plotkin, Uncountable limits and the lambda calculus, Nordic Journal of Computing, vol.2, issue.2, pp.126-145, 1995.

J. Girard, Normal functors, power series and the ?-calculus. Annals of pure and applied logic, pp.129-177, 1988.

X. Gouy, Etude des théoriesthéorieséquationnelles et des propriétés algébriques des modèles stables du ?-calcul, Thèse, 1995.

F. Honsell and S. Rocca, An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, Journal of Computer and System Sciences, vol.45, issue.1, pp.49-75, 1992.
DOI : 10.1016/0022-0000(92)90040-P

J. M. Hyland, A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus, Journal of the London Mathematical Society, vol.2, issue.3, pp.361-37076, 1975.
DOI : 10.1112/jlms/s2-12.3.361

J. M. Hyland and C. L. Ong, On full abstraction for PCF: I, II, and III. Information and Computation, pp.285-408, 2000.

P. T. Johnstone, Stone spaces, 1982.

R. Kerth, Isomorphism and equational equivalence of continuous lambda models, Studia Logica, vol.61, issue.3, pp.403-415, 1998.
DOI : 10.1023/A:1005018121791

R. Kerth, On the construction of stable models of untyped ??-calculus, Theoretical Computer Science, vol.269, issue.1-2, pp.23-46, 2001.
DOI : 10.1016/S0304-3975(00)00371-6

S. Lusin and A. Salibra, The Lattice of Lambda Theories, Journal of Logic and Computation, vol.14, issue.3, pp.373-394, 2004.
DOI : 10.1093/logcom/14.3.373

S. and M. Lane, Categories for the working mathematician. Number 5 in Graduate Texts in Mathematics, 1971.

G. Manzonetto, Models and theories of lambda calculus, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00715207

G. Manzonetto and A. Salibra, Boolean Algebras for Lambda Calculus, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.139-148, 2006.
DOI : 10.1109/LICS.2006.16

G. Manzonetto and A. Salibra, Applying Universal Algebra to Lambda Calculus, Journal of Logic and Computation, vol.20, issue.4, 2008.
DOI : 10.1093/logcom/exn085

R. N. Mckenzie, G. F. Mcnulty, and W. F. Taylor, Algebras, lattices, varieties, Volume I, 1987.

R. S. Pierce, Modules over commutative regular rings. Memoirs Amer, Math. Soc, 1967.

D. Pigozzi and A. Salibra, Lambda abstraction algebras: coordinatizing models of lambda calculus, Fundam. Inf, vol.33, issue.2, pp.149-200, 1998.

G. D. Plotkin, Set-theoretical and other elementary models of the ??-calculus, Theoretical Computer Science, vol.121, issue.1-2, pp.351-409, 1993.
DOI : 10.1016/0304-3975(93)90094-A

A. Salibra, On the algebraic models of lambda calculus, Theoretical Computer Science, vol.249, issue.1, pp.197-240, 2000.
DOI : 10.1016/S0304-3975(00)00059-1

A. Salibra, A continuum of theories of lambda calculus without semantics, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.334-343, 2001.
DOI : 10.1109/LICS.2001.932509

A. Salibra, Topological incompleteness and order incompleteness of the lambda calculus, ACM Transactions on Computational Logic, vol.4, issue.3, pp.379-401, 2003.
DOI : 10.1145/772062.772067

D. S. Scott, Continuous lattices, Toposes, algebraic geometry and logic, 1972.
DOI : 10.1007/BFb0073967

P. Selinger, Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms, 1997.

P. Selinger, Order-incompleteness and finite lambda reduction models, Theoretical Computer Science, vol.309, issue.1-3, pp.43-63, 2003.
DOI : 10.1016/S0304-3975(02)00038-5

V. Stoltenberg-hansen, I. Lindström, and E. R. Griffor, Mathematical theory of domains, 1994.
DOI : 10.1017/CBO9781139166386

D. Vaggione, V with factorable congruences and V = I? a (VDI) imply V is a discriminator variety, Acta Sci. Math, vol.62, pp.359-368, 1996.

D. Vaggione, Varieties in Which the Pierce Stalks Are Directly Indecomposable, Journal of Algebra, vol.184, issue.2, pp.424-434, 1996.
DOI : 10.1006/jabr.1996.0268

A. Visser, Numerations, ?-calculus, and arithmetic, Essays on Combinatory Logic, Lambda-Calculus, and Formalism, pp.259-284, 1980.

C. P. Wadsworth, The Relation between Computational and Denotational Properties for Scott???s ${\text{D}}_\infty $-Models of the Lambda-Calculus, SIAM Journal on Computing, vol.5, issue.3, pp.488-521, 1976.
DOI : 10.1137/0205036