Trust in the λ-calculus

  • Authors:
  • P. Ørbæk;J. Palsberg

  • Affiliations:
  • BRICS, Centre of the Danish National Research Foundation, Dept. of Computer Science, University of Aarhus, Ny Munkegade bld 540, 8000 Aarhus C, Denmark;BRICS, Centre of the Danish National Research Foundation, Dept. of Computer Science, University of Aarhus, Ny Munkegade bld 540, 8000 Aarhus C, Denmark

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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 is presented as annotations of the underlying Curry types, and type inference is computable in O(n3) time.