Flat Domains and Recursive Equations in ACL2

作者: John Cowles

DOI:

关键词:

摘要: Flat domains can be viewed as a “logic” of total functions in which every recursive equation has at least one function that satisfies it. One formalization flat ACL2 is presented some detail. are reviewed enough detail to make this paper self contained for those who never knew or don’t remember much about them.

参考文章(9)
Jr. Guy L. Steele, Common LISP: the language (2nd ed.) Digital Press. ,(1990)
Panagiotis Manolios, J. Strother Moore, Matt Kaufmann, Computer-aided reasoning : ACL2 case studies Kluwer Academic. ,(2000)
Zohar Manna, Mathematical Theory of Computation Dover Publications, Incorporated. ,(2003)
Panagiotis Manolios, J. Strother Moore, Matt Kaufmann, Computer-Aided Reasoning: An Approach ,(2011)
Guy Steele, Common Lisp the Language ,(1984)
Panagiotis Manolios, J Strother Moore, Partial Functions in ACL2 Journal of Automated Reasoning. ,vol. 31, pp. 107- 127 ,(2003) , 10.1023/B:JARS.0000009505.07087.34
Elaine Weyuker, Ron Segal, Martin Davies, Computability, complexity, and languages ,(1983)