So anything that you may want to express on a complex object that would seem to require first - order predicate calculus can be expressed actually quite nicely within the confines of the programming language 所以对于一个复杂对象,任何看起来需要一阶谓词演算才能描述的东西,实际都可以在编程语言范畴内实现十分精细地表述。
This paper introduces first - order predicate calculus and assertion method from precondition to postcondition into the research of refactoring . and a logic deduction system is put forward in this paper : refactoring reliability deduction system 引入了一阶谓词演算和前后断言方法,并且自定义了一个重构可靠性证明的逻辑推理系统:重构可靠性推演系统。
This has led some people who design the specification mechanisms for programming languages , or in the case of uml , for modeling languages , to include facilities from first - order predicate calculus as a language extension 这就促使一些人在编程语言的描述机制和建模语言(如统一建模语言, uml )的处理机制中加进了部分一阶谓词演算的东西,作为一种功能扩展。
The second occasion where boolean expressions may seem restrictive is one that scares most people who have looked at the issue from a theoretical perspective : the language of boolean expressions is relatively limited and doesn ' t have first - order predicate calculus 很多人从理论角度考察时,又惊惧地发现布尔表达式形似柔弱的第二种情况:使用布尔表达式的语言有局限性,因为不具备一阶谓词演算特性。