Since 2014
Trust in the lambda-calculus
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Trust in the lambda-calculus
|
|
| Creator |
Palsberg, Jens
Ørbæk, Peter |
|
| Description |
This paper introduces trust analysis for higher-order languages. Trustanalysis encourages the programmer to make explicit the trustworthiness ofdata, and in return it can guarantee that no mistakes with respect to trust willbe made at run-time. We present a confluent lambda-calculus with explicit trustoperations, and we equip it with a trust-type system which has the subjectreduction property. Trust information in presented as two annotations of eachfunction type constructor, and type inference is computable in O(n^3) time.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-01
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19934
10.7146/brics.v2i31.19934 |
|
| Source |
BRICS Report Series; No 31 (1995): RS-31 Trust in the lambda-calculus
BRICS Report Series; No 31 (1995): RS-31 Trust in the lambda-calculus 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19934/17587
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|