Trust in the lambda-calculus

Forfattere

  • Jens Palsberg
  • Peter Ørbæk

DOI:

https://doi.org/10.7146/brics.v2i31.19934

Resumé

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 lambda-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(n^3) time.

Downloads

Publiceret

1995-06-01

Citation/Eksport

Palsberg, J., & Ørbæk, P. (1995). Trust in the lambda-calculus. BRICS Report Series, 2(31). https://doi.org/10.7146/brics.v2i31.19934

Nummer

Nr. 31 (1995): RS-31 Trust in the lambda-calculus

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).