The character of the thesis was the following : ( 1 ) giving the modification of lambda calculus in order to describe the character of dynamic fuzzy ; ( 2 ) giving an operational semantics model of dfl programming language which can solve dynamic fuzzy problems and proving the correctness and reliability of it ; ( 3 ) giving the frame of dfl programming language 本文的特色體現(xiàn)在: ( 1 )提出了可以描述動(dòng)態(tài)模糊性問(wèn)題的演算的變形方法; ( 2 )提出了可以解決動(dòng)態(tài)模糊性問(wèn)題的dfl程序設(shè)計(jì)語(yǔ)言的操作語(yǔ)義模型,并對(duì)該模型的正確性和可靠性進(jìn)行了證明; ( 3 )提出了dfl程序設(shè)計(jì)語(yǔ)言的基本框架結(jié)構(gòu)。
The main work included : the classical lambda calculus was modified to describe the character of dynamic fuzzy ; the abstract syntax of dfl programming language was described through bnf notation ; an operational semantics model of dfl programming language was proposed with a ternary array < dfsc , dfo , dfss > and then some basic data types and several mechanisms of constructing new data types were defined ; the frame of dfl progaramming language was provided ; it was described how to solve some problems applying the operational semantics model ; the correctness and reliability of the operational semantics model were proved by hoare logic and denotational semantics 主要內(nèi)容包括:變形傳統(tǒng)的演算,以更好地描述具有動(dòng)態(tài)模糊性的問(wèn)題;通過(guò)bnf描述了dfl程序設(shè)計(jì)語(yǔ)言的抽象語(yǔ)法;通過(guò)一個(gè)三元組< dfsc , dfo , dfss >給出了dfl程序設(shè)計(jì)語(yǔ)言的操作語(yǔ)義模型;給出了dfl程序設(shè)計(jì)語(yǔ)言的基本框架結(jié)構(gòu);給出了該操作語(yǔ)義模型的一些應(yīng)用實(shí)例;通過(guò)hoare邏輯和基本指稱語(yǔ)義對(duì)本文所定義的操作語(yǔ)義模型的正確性和可靠性進(jìn)行了證明。由此可見(jiàn),本文從全新的角度定義了一種可以處理動(dòng)態(tài)模糊問(wèn)題的程序設(shè)計(jì)語(yǔ)言。
百科解釋
Lambda calculus (also written as λ-calculus or called "the lambda calculus") is a formal system in mathematical logic and computer science for expressing computation by way of variable binding and substitution. First formulated by Alonzo Church, lambda calculus found early successes in the area of computability theory, such as a negative answer to Hilbert's Entscheidungsproblem.