8.7 Building New Contract Combinators
(require racket/contract/combinator) | package: base |
Contracts are represented internally as functions that accept information about the contract (who is to blame, source locations, etc.) and produce projections (in the spirit of Dana Scott) that enforce the contract. A projection is a function that accepts an arbitrary value, and returns a value that satisfies the corresponding contract. For example, a projection that accepts only integers corresponds to the contract (flat-contract integer?), and can be written like this:
(define int-proj (λ (x) (if (integer? x) x (signal-contract-violation))))
As a second example, a projection that accepts unary functions on integers looks like this:
(define int->int-proj (λ (f) (if (and (procedure? f) (procedure-arity-includes? f 1)) (λ (x) (int-proj (f (int-proj x)))) (signal-contract-violation))))
Although these projections have the right error behavior, they are not quite ready for use as contracts, because they do not accommodate blame and do not provide good error messages. In order to accommodate these, contracts do not just use simple projections, but use functions that accept a blame object encapsulating the names of two parties that are the candidates for blame, as well as a record of the source location where the contract was established and the name of the contract. They can then, in turn, pass that information to raise-blame-error to signal a good error message.
(define (int-proj blame) (λ (x) (if (integer? x) x (raise-blame-error blame val '(expected: "<integer>" given: "~e") val))))
Contracts, in this system, are always established between two parties. One party provides some value according to the contract, and the other consumes the value, also according to the contract. The first is called the “positive” person and the second the “negative”. So, in the case of just the integer contract, the only thing that can go wrong is that the value provided is not an integer. Thus, only the positive party can ever accrue blame. The raise-blame-error function always blames the positive party.
Compare that to the projection for our function contract:
(define (int->int-proj blame) (define dom (int-proj (blame-swap blame))) (define rng (int-proj blame)) (λ (f) (if (and (procedure? f) (procedure-arity-includes? f 1)) (λ (x) (rng (f (dom x)))) (raise-blame-error blame val '(expected "a procedure of one argument" given: "~e") val))))
In this case, the only explicit blame covers the situation where either a non-procedure is supplied to the contract or the procedure does not accept one argument. As with the integer projection, the blame here also lies with the producer of the value, which is why raise-blame-error is passed blame unchanged.
The checking for the domain and range are delegated to the int-proj function, which is supplied its arguments in the first two lines of the int->int-proj function. The trick here is that, even though the int->int-proj function always blames what it sees as positive, we can swap the blame parties by calling blame-swap on the given blame object, replacing the positive party with the negative party and vice versa.
This technique is not merely a cheap trick to get the example to work, however. The reversal of the positive and the negative is a natural consequence of the way functions behave. That is, imagine the flow of values in a program between two modules. First, one module defines a function, and then that module is required by another. So, far the function itself has to go from the original, providing module to the requiring module. Now, imagine that the providing module invokes the function, supplying it an argument. At this point, the flow of values reverses. The argument is traveling back from the requiring module to the providing module! And finally, when the function produces a result, that result flows back in the original direction. Accordingly, the contract on the domain reverses the positive and the negative blame parties, just like the flow of values reverses.
We can use this insight to generalize the function contracts and build a function that accepts any two contracts and returns a contract for functions between them.
This projection also goes further and uses blame-add-context to improve the error messages when a contract violation is detected.
(define (make-simple-function-contract dom-proj range-proj) (λ (blame) (define dom (dom-proj (blame-add-context blame "the argument of" #:swap? #t))) (define rng (range-proj (blame-add-context blame "the range of"))) (λ (f) (if (and (procedure? f) (procedure-arity-includes? f 1)) (λ (x) (rng (f (dom x)))) (raise-blame-error blame val '(expected "a procedure of one argument" given: "~e") val)))))
(define (int->int-proj blame) (define dom-blame (blame-add-context blame "the argument of" #:swap? #t)) (define rng-blame (blame-add-context blame "the range of")) (define (check-int v to-blame neg-party) (unless (integer? x) (raise-blame-error to-blame #:missing-party neg-party val '(expected "an integer" given: "~e") val))) (λ (f) (if (and (procedure? f) (procedure-arity-includes? f 1)) (λ (neg-party) (λ (x) (check-int x dom-blame neg-party) (define ans (f x)) (check-int ans rng-blame neg-party) ans)) (λ (neg-party) (raise-blame-error blame #:missing-party neg-party val '(expected "a procedure of one argument" given: "~e") val)))))
Projections like the ones described above, but suited to other, new kinds of value you might make, can be used with the contract library primitives below.
procedure
(make-contract [ #:name name #:first-order test #:val-first-projection val-first-proj #:projection proj #:stronger stronger #:list-contract is-list-contract?]) → contract? name : any/c = 'anonymous-contract test : (-> any/c any/c) = (λ (x) #t)
val-first-proj : (or/c #f (-> blame? (-> any/c (-> any/c any/c)))) = #f
proj : (-> blame? (-> any/c any/c)) =
(λ (b) (λ (x) (if (test x) x (raise-blame-error b x '(expected: "~a" given: "~e") name x)))) stronger : (or/c #f (-> contract? contract? boolean?)) = #f is-list-contract? : boolean? = #f
procedure
(make-chaperone-contract [ #:name name #:first-order test #:val-first-projection val-first-proj #:projection proj #:stronger stronger #:list-contract is-list-contract?]) → chaperone-contract? name : any/c = 'anonymous-chaperone-contract test : (-> any/c any/c) = (λ (x) #t)
val-first-proj : (or/c #f (-> blame? (-> any/c (-> any/c any/c)))) = #f
proj : (-> blame? (-> any/c any/c)) =
(λ (b) (λ (x) (if (test x) x (raise-blame-error b x '(expected: "~a" given: "~e") name x)))) stronger : (or/c #f (-> contract? contract? boolean?)) = #f is-list-contract? : boolean? = #f
procedure
(make-flat-contract [ #:name name #:first-order test #:val-first-projection val-first-proj #:projection proj #:stronger stronger #:list-contract is-list-contract?]) → flat-contract? name : any/c = 'anonymous-flat-contract test : (-> any/c any/c) = (λ (x) #t)
val-first-proj : (or/c #f (-> blame? (-> any/c (-> any/c any/c)))) = #f
proj : (-> blame? (-> any/c any/c)) =
(λ (b) (λ (x) (if (test x) x (raise-blame-error b x '(expected: "~a" given: "~e") name x)))) stronger : (or/c #f (-> contract? contract? boolean?)) = #f is-list-contract? : boolean? = #f
These functions build simple higher-order contracts, chaperone contracts, and flat contracts, respectively. They both take the same set of three optional arguments: a name, a first-order predicate, and a blame-tracking projection.
The name argument is any value to be rendered using display to describe the contract when a violation occurs. The default name for simple higher-order contracts is anonymous-contract, for chaperone contracts is anonymous-chaperone-contract, and for flat contracts is anonymous-flat-contract.
The first-order predicate test can be used to determine which values the contract applies to; usually, this is the set of values for which the contract fails immediately without any higher-order wrapping. This test is used by contract-first-order-passes?, and indirectly by or/c to determine which of multiple higher-order contracts to wrap a value with. The default test accepts any value.
The projection proj defines the behavior of applying the contract. It is a curried function of two arguments: the first application accepts a blame object, and the second accepts a value to protect with the contract. The projection must either produce the value, suitably wrapped to enforce any higher-order aspects of the contract, or signal a contract violation using raise-blame-error. The default projection produces an error when the first-order test fails, and produces the value unchanged otherwise.
Projections for chaperone contracts must produce a value that passes chaperone-of? when compared with the original, uncontracted value. Projections for flat contracts must fail precisely when the first-order test does, and must produce the input value unchanged otherwise. Applying a flat contract may result in either an application of the predicate, or the projection, or both; therefore, the two must be consistent. The existence of a separate projection only serves to provide more specific error messages. Most flat contracts do not need to supply an explicit projection.
The stronger argument is used to implement contract-stronger?. The first argument is always the contract itself and the second argument is whatever was passed as the second argument to contract-stronger?.
The is-list-contract? argument is used by the list-contract? predicate to determine if this is a contract that accepts only list? values.
Examples: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Changed in version 6.0.1.13 of package base: Added the #:list-contract? argument.
procedure
(build-compound-type-name c/s ...) → any
c/s : any/c
procedure
(coerce-contract id x) → contract?
id : symbol? x : any/c
If x is not one of the coercible values, coerce-contract signals an error, using the first argument in the error message.
procedure
(coerce-chaperone-contracts id x) → (listof chaperone-contract?)
id : symbol? x : (listof any/c)
procedure
(coerce-flat-contract id x) → flat-contract?
id : symbol? x : any/c
procedure
(coerce-flat-contracts id x) → (listof flat-contract?)
id : symbol? x : (listof any/c)
procedure
(coerce-contract/f x) → (or/c contract? #f)
x : any/c
8.7.1 Blame Objects
procedure
(blame-add-context blame context [ #:important important #:swap? swap?]) → blame? blame : blame? context : (or/c string? #f) important : (or/c string? #f) = #f swap? : boolean? = #f
The context argument describes one layer of the portion of the contract, typically of the form "the 1st argument of" (in the case of a function contract) or "a conjunct of" (in the case of an and/c contract).
> (define/contract f (list/c (-> integer? integer?)) (list (λ (x) x)))
> ((car f) #f) f: contract violation
expected: integer?
given: #f
in: the 1st argument of
the 1st element of
(list/c (-> integer? integer?))
contract from: (definition f)
blaming: top-level
(assuming the contract is correct)
at: eval:2.0
The important argument is used to build the beginning part of the contract violation. The last important argument that gets added to a blame object is used. The class/c contract adds an important argument, as does the -> contract (when -> knows the name of the function getting the contract).
The swap? argument has the effect of calling blame-swap while adding the layer of context, but without creating an extra blame object.
The context information recorded in blame structs keeps track of combinators that do not add information, and add the string "..." for them, so programmers at least see that there was some context they are missing in the error messages. Accordingly, since there are combinators that should not add any context (e.g., recursive-contract), passing #f as the context string argument avoids adding the "..." string.
procedure
(blame-positive b) → any/c
b : blame?
procedure
(blame-negative b) → any/c
b : blame?
procedure
(blame-contract b) → any/c
b : blame?
procedure
(blame-value b) → any/c
b : blame?
procedure
(blame-source b) → srcloc?
b : blame?
procedure
(blame-swap b) → blame?
b : blame?
procedure
(blame-original? b) → boolean?
b : blame?
procedure
(blame-swapped? b) → boolean?
b : blame?
procedure
(blame-replace-negative b neg) → blame?
b : blame? neg : any/c
procedure
(blame-update b pos neg) → blame?
b : blame? pos : any/c neg : any/c
procedure
(raise-blame-error b x fmt v ...) → none/c
b : blame? x : any/c
fmt :
(or/c string? (listof (or/c string? 'given 'given: 'expected 'expected:))) v : any/c
The remaining arguments are a format string, fmt, and its arguments, v ..., specifying an error message specific to the precise violation.
If fmt is a list, then the elements are concatenated together (with spaces added, unless there are already spaces at the ends of the strings), after first replacing symbols with either their string counterparts, or replacing 'given with "produced" and 'expected with "promised", depending on whether or not the b argument has been swapped or not (see blame-swap).
If fmt contains the symbols 'given: or 'expected:, they are replaced like 'given: and 'expected: are, but the replacements are prefixed with the string "\n " to conform to the error message guidelines in Error Message Conventions.
struct
(struct exn:fail:contract:blame exn:fail:contract (object) #:extra-constructor-name make-exn:fail:contract:blame) object : blame?
the blame object for the violation,
the value that the contract applies to, and
a message indicating the kind of violation.
Examples: | |||||||||||||||||||||||||||||||||||||||||||||||
|
8.7.2 Contracts as structs
The property prop:contract allows arbitrary structures to act as contracts. The property prop:chaperone-contract allows arbitrary structures to act as chaperone contracts; prop:chaperone-contract inherits prop:contract, so chaperone contract structures may also act as general contracts. The property prop:flat-contract allows arbitrary structures to act as flat contracts; prop:flat-contract inherits both prop:chaperone-contract and prop:procedure, so flat contract structures may also act as chaperone contracts, as general contracts, and as predicate procedures.
value
value
value
value
value
procedure
(build-flat-contract-property [ #:name get-name #:first-order get-first-order #:val-first-projection val-first-proj #:projection get-projection #:stronger stronger #:generate generate] #:exercise exercise [ #:list-contract? is-list-contract?]) → flat-contract-property?
get-name : (-> contract? any/c) = (λ (c) 'anonymous-flat-contract)
get-first-order : (-> contract? (-> any/c boolean?)) = (λ (c) (λ (x) #t))
val-first-proj : (or/c #f (-> contract? blame? (-> any/c (-> any/c any/c)))) = #f
get-projection : (-> contract? (-> blame? (-> any/c any/c))) =
(λ (c) (λ (b) (λ (x) (if ((get-first-order c) x) x (raise-blame-error b x '(expected: "~a" given: "~e") (get-name c) x))))) stronger : (or/c (-> contract? contract? boolean?) #f) = #f
generate :
(->i ([c contract?]) ([generator (c) (-> (and/c positive? real?) (or/c #f (-> c)))])) = #f
exercise :
(->i ([c contract?]) ([result (c) (-> (and/c positive? real?) (values (-> c void?) (listof contract?)))])) is-list-contract? : (-> contract? boolean?) = (λ (c) #f)
procedure
(build-chaperone-contract-property [ #:name get-name #:first-order get-first-order #:val-first-projection val-first-proj #:projection get-projection #:stronger stronger #:generate generate] #:exercise exercise [ #:list-contract? is-list-contract?]) → chaperone-contract-property?
get-name : (-> contract? any/c) = (λ (c) 'anonymous-chaperone-contract)
get-first-order : (-> contract? (-> any/c boolean?)) = (λ (c) (λ (x) #t))
val-first-proj : (or/c #f (-> contract? blame? (-> any/c (-> any/c any/c)))) = #f
get-projection : (-> contract? (-> blame? (-> any/c any/c))) =
(λ (c) (λ (b) (λ (x) (if ((get-first-order c) x) x (raise-blame-error b x '(expected: "~a" given: "~e") (get-name c) x))))) stronger : (or/c (-> contract? contract? boolean?) #f) = #f
generate :
(->i ([c contract?]) ([generator (c) (-> (and/c positive? real?) (or/c #f (-> c)))])) = #f
exercise :
(->i ([c contract?]) ([result (c) (-> (and/c positive? real?) (values (-> c void?) (listof contract?)))])) is-list-contract? : (-> contract? boolean?) = (λ (c) #f)
procedure
(build-contract-property [ #:name get-name #:first-order get-first-order #:val-first-projection val-first-proj #:projection get-projection #:stronger stronger #:generate generate] #:exercise exercise [ #:list-contract? is-list-contract?]) → contract-property? get-name : (-> contract? any/c) = (λ (c) 'anonymous-contract)
get-first-order : (-> contract? (-> any/c boolean?)) = (λ (c) (λ (x) #t))
val-first-proj : (or/c #f (-> contract? blame? (-> any/c (-> any/c any/c)))) = #f
get-projection : (-> contract? (-> blame? (-> any/c any/c))) =
(λ (c) (λ (b) (λ (x) (if ((get-first-order c) x) x (raise-blame-error b x '(expected: "~a" given: "~e") (get-name c) x))))) stronger : (or/c (-> contract? contract? boolean?) #f) = #f
generate :
(->i ([c contract?]) ([generator (c) (-> (and/c positive? real?) (or/c #f (-> c)))])) = #f
exercise :
(->i ([c contract?]) ([result (c) (-> (and/c positive? real?) (values (-> c void?) (listof contract?)))])) is-list-contract? : (-> contract? boolean?) = (λ (c) #f)
These functions build the arguments for prop:contract, prop:chaperone-contract, and prop:flat-contract, respectively.
A contract property specifies the behavior of a structure when used as a contract. It is specified in terms of five accessors: get-name, which produces a description to write as part of a contract violation; get-first-order, which produces a first-order predicate to be used by contract-first-order-passes?; get-projection, which produces a blame-tracking projection defining the behavior of the contract; stronger, which is a predicate that determines whether this contract (passed in the first argument) is stronger than some other contract (passed in the second argument); generate, which returns a thunk that generates random values matching the contract or #f, indicating that random generation for this contract isn’t supported; exercise, which returns a function that exercises values matching the contract (e.g., if it is a function contract, it may call the function) and a list of contracts whose values will be generated by this process; and is-flat-contract?, which is used by flat-contract? to determine if this contract accepts only list?s.
These accessors are passed as (optional) keyword arguments to build-contract-property, and are applied to instances of the appropriate structure type by the contract system. Their results are used analogously to the arguments of make-contract.
A chaperone contract property specifies the behavior of a structure when used as a chaperone contract. It is specified using build-chaperone-contract-property, and accepts exactly the same set of arguments as build-contract-property. The only difference is that the projection accessor must return a value that passes chaperone-of? when compared with the original, uncontracted value.
A flat contract property specifies the behavior of a structure when used as a flat contract. It is specified using build-flat-contract-property, and accepts exactly the same set of arguments as build-contract-property. The only difference is that the projection accessor is expected not to wrap its argument in a higher-order fashion, analogous to the constraint on projections in make-flat-contract.
Changed in version 6.0.1.13 of package base: Added the #:list-contract? argument.
procedure
(contract-property? x) → boolean?
x : any/c
procedure
x : any/c
procedure
x : any/c
8.7.3 Obligation Information in Check Syntax
Check Syntax in DrRacket shows obligation information for contracts according to syntax-propertys that the contract combinators leave in the expanded form of the program. These properties indicate where contracts appear in the source and where the positive and negative positions of the contracts appear.
To make Check Syntax show obligation information for your new contract combinators, use the following properties (some helper macros and functions are below):
- This property should be attached to the result of a transformer that implements a contract combinator. It signals to Check Syntax that this is where a contract begins.
The first element in the vector should be a unique (in the sense of eq?) value that Check Syntax can use a tag to match up this contract with its subpieces (specified by the two following syntax properties).
The second and third elements of the vector are syntax objects from pieces of the contract, and Check Syntax will color them. The first list should contain subparts that are the responsibility of parties (typically modules) that provide implementations of the contract. The second list should contain subparts that are the responsibility of clients.
For example, in (->* () #:pre #t any/c #:post #t), the ->* and the #:post should be in the first list and #:pre in the second list.
- This property should be attached to sub-expressions of a contract combinator that are expected to be other contracts. The value of the property should be the key (the first element from the vector for the 'racket/contract:contract property) indicating which contract this is.
This property should be used when the expression’s value is a contract that clients are responsible for.
- This form is just like 'racket/contract:negative-position, except that it should be used when the expression’s value is a contract that the original party should be responsible for.
- The presence of this property tells Check Syntax that it should start coloring from this point. It expects the expression to be a contract (and, thus, to have the 'racket/contract:contract property); this property indicates that this contract is on a (module) boundary.
(The value of the property is not used.)
'racket/contract:internal-contract : symbol?
Like 'racket/contract:contract-on-boundary, the presence of this property triggers coloring, but this is meant for use when the party (module) containing the contract (regardless of whether or not this module exports anything matching the contract) can be blamed for violating the contract. This comes into play for ->i contracts, since the contract itself has access to values under contract via the dependency.
syntax
(define/final-prop header body ...)
header = main-id | (main-id id ...) | (main-id id ... . id)
syntax
(define/subexpression-pos-prop header body ...)
header = main-id | (main-id id ...) | (main-id id ... . id)
8.7.4 Utilities for Building New Combinators
procedure
(contract-stronger? x y) → boolean?
x : contract? y : contract?
This function is conservative, so it may return #f when x does, in fact, accept fewer values.
Examples: | ||||||||||||
|
procedure
(contract-first-order-passes? contract v) → boolean?
contract : contract? v : any/c
If it returns #f, the contract is guaranteed not to hold for that value; if it returns #t, the contract may or may not hold. If the contract is a first-order contract, a result of #t guarantees that the contract holds.
procedure
(contract-first-order c) → (-> any/c boolean?)
c : contract?