请输入您要查询的字词:

 

单词 A1TheFirstPresentation
释义

A.1 The first presentation


The objects and types of our type theoryPlanetmathPlanetmath may be written as terms usingthe following syntax, which is an extensionPlanetmathPlanetmathPlanetmath of λ-calculus withvariables x,x,,primitive constantsc,c,, defined constants f,f,, and term formingoperationsMathworldPlanetmath

t::=xλx.tt(t)cf

The notation used here means that a term t is either a variable x, or ithas the form λx.t where x is a variable and t is a term, or it hasthe form t(t) where t and t are terms, or it is a primitive constantc, or it is a defined constant f. The syntactic markers ’λ’, ’(’,’)’, and ’.’ are punctuation for guiding the human eye.

We use t(t1,,tn) as an abbreviation for the repeated applicationt(t1)(t2)(tn). We may also use infix notation, writing t1t2 for (t1,t2) when is a primitive or definedconstant.

Each defined constant has zero, one or more defining equations.There are two kinds of defined constant. An explicitdefined constant f has a single defining equation

f(x1,,xn):t,

where t does not involve f.For example, we might introduce the explicit defined constant with defining equation

(x,y)(z):x(y(z)),

and use infix notation xy for (x,y). This of course is just composition of functions.

The second kind of defined constant is used to specify a (parameterized) mappingf(x1,,xn,x), where x ranges over a type whose elements are generatedby zero or more primitive constants. For each such primitive constant c thereis a defining equation of the form

f(x1,,xn,c(y1,,ym)):t,

where f may occur in t, but only in such a way that it is clear that theequations determine a totally defined function. The paradigm examples of suchdefined functions are the functions defined by primitive recursion on thenatural numbersMathworldPlanetmath. We may call this kind of definition of a function a totalrecursive definition.In computer science and logic this kind of definitionof a function on a recursive data type has been called a definition bystructural recursion.

Convertibilitytt between terms tand t is the equivalence relationMathworldPlanetmath generated by the defining equations for constants,the computation rule

(λx.t)(u):t[u/x],

and the rules which make it a congruencePlanetmathPlanetmathPlanetmath with respect to application and λ-abstraction:

  • if tt and ss then t(s)t(s), and

  • if tt then (λx.t)(λx.t).

The equality judgment tu:A is then derived by the following single rule:

  • if t:A, u:A, and tu, then tu:A.

Judgmental equality is an equivalence relation.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 19:55:33