Abstract
This paper introduces trust analysis for higher-order languages. Trust analysis encourages the programmer to make explicit the trustworthiness of data, and in return it can guarantee that no mistakes with respect to trust will be made at run-time. We present a confluent λ-calculus with explicit trust operations, and we equip it with a trust-type system which has the subject reduction property. Trust information in presented as two annotations of each function type constructor, and type inference is computable in O(n3) time.
Cite
CITATION STYLE
Palsberg, J., & Θrbaek, P. (1995). Trust in the λ-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 983, pp. 315–329). Springer Verlag. https://doi.org/10.1007/3-540-60360-3_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
