Turning inductive into equational specifications

by Stefan Berghofer , Lukas Bulwahn , Florian Haftmann , Technische Universität München
Citations:8 - 5 self

Documents Related by Co-Citation

17 Code generation via higher-order rewrite systems – Florian Haftmann, Tobias Nipkow - 2010
731 Isabelle/HOL: a proof assistant for higher-order logic, volume 2283 – Tobias Nipkow, Lawrence C Paulson, Markus Wenzel - 2002
21 Certification of termination proofs using CeTA – René Thiemann, Christian Sternagel - 2009
48 Executing higher order logic – Stefan Berghofer, Tobias Nipkow, Technische Universität München - 2002
12 Imperative functional programming with isabelle/hol – Lukas Bulwahn, Er Krauss, Florian Haftmann, Levent Erkök, John Matthews, Technische Universität München - 2008
8 Partial and nested recursive function definitions in higher-order logic – A Krauss
214 Termination of Term Rewriting Using Dependency Pairs – Thomas Arts, Jürgen Giesl - 2000
114 On proving term rewrite systems are noetherian – D Lankford - 1979
91 AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework – Jürgen Giesl, Peter Schneider-kamp, René Thiemann - 2006
40 Automatic Generation of Mode Declarations for Prolog Programs (draft – C S Mellish - 1981
38 Adding equations to NU-Prolog – Lee Naish - 1991
8 Bounded model generation for Isabelle/HOL – Tjark Weber - 2005
37 Multi-paradigm Declarative Languages – Michael Hanus - 2007
19 Systematic generation of glass-box test cases for functional logic programs – Sebastian Fischer, Herbert Kuchen - 2007
7 Verifying a hotel key card system – Tobias Nipkow - 2006
13 EasyCheck — Test Data for Free – Jan Christiansen, Sebastian Fischer - 2008
10 Property directed generation of first-order test data. The Eigth Symposium on Trends – Fredrik Lindblad - 2007
15 Mode Analysis Domains for Typed Logic Programs – Jan Georg Smaus, Patricia M. Hill, Andy King - 2000
311 QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs – Koen Claessen, John Hughes - 2000