Docs / Semantics / Composition / CallByValue

Partial functions

import Linglib.Semantics.Composition.CallByValue · namespace Interpreter

Heim and Kratzer let a function be undefined at some of its arguments, as the definite article is at a predicate not true of exactly one individual, and from there on every function type is the type of partial functions. This is the call-by-value translation of types at the effect of partiality: a function returns a partial value, and a constituent has one. Functional application is then Structured App followed by Join, and predicate modification is defined where both predicates are. A total value has a partial value that is it, and application and predicate modification keep the two related, so a constituent with no partial word in it never lacks a value.

Main definitions

References

Declarations

The call-by-value translation of a type at partiality: every function is a partial function.

@[reducible] def Ty.cbvL49–55
{B : Type} :
Ty B → Ty B

Used by Ty.cbv_fn, Ty.cbv_t, Ty.cbv_base, Ty.CbvRel, Ty.PartRel, Ty.PartRel.dom, Ty.cbvRel_fn_iff, Application.evalCbv, PredicateModification.evalCbv, Application.evalCbv_fa, Application.partRel_evalCbv, PredicateModification.partRel_evalCbv, Ty.PDom

Used in HeimKratzer1998

L59
L61

A total value and the value of the translated type that is it: a function and a partial function defined at every total argument, with the value that is the function's.

def Ty.CbvRelL63–69
{B : Type} {D : B → Type} (a : Ty B) :
Dom D a → Dom D a.cbv → Prop

Built from

Used by Ty.PartRel, Ty.cbvRel_fn_iff, Ty.cbvRel_t, Ty.cbvRel_base

L84
L86–87

Application of a partial value that is a partial function to a partial value: defined where both are and the function is at the argument.

def Application.evalCbvL91–96
{B : Type} (D : B → Type) {l r u : Ty B} :
Application l r u → Part (Ty.Dom D l.cbv) → Part (Ty.Dom D r.cbv) → Part (Ty.Dom D u.cbv)

Built from

Used by Application.evalCbv_fa, Application.partRel_evalCbv

Predicate modification takes total predicates and the partial values that are them to a total predicate and the partial value that is it.

theorem PredicateModification.partRel_evalCbvL132–150
{B : Type} {D : B → Type} {l r u : Ty B} (m : PredicateModification l r u) {x : Ty.Dom D l} {x' : Part (Ty.Dom D l.cbv)} {y : Ty.Dom D r} {y' : Part (Ty.Dom D r.cbv)} :
l.PartRel x x' → r.PartRel y y' → u.PartRel (eval D m x y) (evalCbv D m x' y')

Built from , ,

L161–170

Partial values where a word has them

Where only some words are partial, their types say so, and constituents are partial values combined by the rules of a grammar where both sisters are defined.

L209–216