Search

Copyright © 2017 Silvia Sancilio et al. Pterygium is a relatively common eye disease that can display an aggressive clinical behaviour. To evaluate the in vitro effects of Curcuma longa on human pterygium-derived keratinocytes, specimens of pterygium from 20 patients undergoing pterygium surgical excision were collected. Pterygium explants were put into culture and derived keratinocytes were treated with an alcoholic extract of 1.3% Curcuma longa in 0.001% Benzalkonium Chloride for 3, 6, and 24 h. Cultured cells were examined for CAM5.2 (anti-cytokeratin antibody) and CD140 (anti-fibroblast transmembrane glycoprotein antibody) expression between 3th and 16th passage to assess cell homogeneity. TUNEL technique and Annexin-V/PI staining in flow cytometry were used to detect keratinocyte apoptosis. We showed that Curcuma longa exerts a proapoptotic effect on pterygium-derived keratinocytes already after 3 h treatment. Moreover, after 24 h treatment, Curcuma longa induces a significant increase in TUNEL as well as Annexin-V/PI positive cells in comparison to untreated samples. Our study confirms previous observations highlighting the expression, in pterygium keratinocytes, of nuclear VEGF and gives evidence for the first time to the expression of nuclear and cytoplasmic VEGF-R1. All in all, these findings suggest that Curcuma longa could have some therapeutic potential in the treatment and prevention of human pterygium.

We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a predicate. This allows us to prove the consistency of a well-know lambda theory: this consistency has interesting consequences on the algebraic structure of the lattice of lambda theories.

We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics and the F-semantics. These semantics arise by taking as interpretation of types subsets of applicative structures, as interpretation of the intersection constructor set-theoretic inclusion, and by taking the interpretation of the arrow constructor a' la Scott, with respect to either any possible functionality set, or the largest one, or the least one. These results strengthen and generalize significantly all earlier results in the literature, to our knowledge, in at least three respects. First of all the inference semantics had not been considered before. Secondly, the characterizations are all given just in terms of simple closure conditions on the preorder relation on the types, rather than on the typing judgments themselves. The task of checking the condition is made therefore considerably more tractable. Lastly, we do not restrict attention just to lambda-models, but to arbitrary applicative structures which admit an interpretation function. Thus we allow also for the treatment of models of restricted lambda-calculi. Nevertheless the characterizations we give can be tailored just to the case of lambda-models., Comment: 26 pages, no figure

Promotor : H. Barendregt, Contains fulltext : mmubn000001_232205140.pdf (publisher's version ) (Open Access)

Promotor : H. Barendregt, Contains fulltext : mmubn000001_232205140.pdf (publisher's version ) (Open Access)

Promotor : H. Barendregt, Contains fulltext : mmubn000001_232205140.pdf (publisher's version ) (Open Access)

Contains fulltext : 13268.pdf (publisher's version ) (Open Access)

Contains fulltext : 13268.pdf (publisher's version ) (Open Access)

Contains fulltext : 13268.pdf (publisher's version ) (Open Access)