Combining interactive and automatic reasoning in first order theories of functional programs
MetadataShow full item record
We propose a new approach to the computer-assisted verification of functional programs. We work in first order theories of functional programs which are obtained by extending Aczel's first order theory of combinatory formal arithmetic with positive inductive and coinductive predicates. Rather than building a special purpose system we implement our theories in Agda, a proof assistant for dependent type theory which can be used as a generic theorem prover. Agda provides support for interactive reasoning by encoding first order theories using the formulae-as-types principle. Further support is provided by off-the-shelf automatic theorem provers for first order logic which can be called by a program which translates Agda representations of first order formulae into the TPTP language understood by the provers. We show some examples where we combine interactive and automatic reasoning, covering both proof by induction and coinduction. © 2012 Springer-Verlag Berlin Heidelberg.
Showing items related by title, author, creator and subject.
Bove, Ana; Dybjer, Peter; Sicard Ramírez, Andrés (Birkedal, 2012-04-01)We propose a new approach to the computer-assisted verification of functional programs. We work in first order theories of functional programs which are obtained by extending Aczel?s first order theory of combinatory formal ...
Simon, Laurent; Ospina, Juan (TAYLOR & FRANCIS INC, 2014-06-03)A Laplace transform-based procedure was proposed to calculate the effective time constant for a class of nonlinear diffusion problems. The governing mathematical representation was first estimated with a linear model by ...
Quaternion and octonion-based finite element analysis methods for computing multiple first order derivatives Aristizabal, Mauricio; Ramirez-Tamayo, Daniel; Garcia, Manuel; Aguirre-Mesa, Andres; Montoya, Arturo; Millwater, Harry (Elsevier Inc., 2019-11-15)The complex Taylor series expansion method for computing accurate first order derivatives is extended in this work to quaternion, octonion and any order Cayley-Dickson algebra. The advantage of this new approach is that ...