A Step Towards the Mechanization of Partial Functions: Domains as Inductive Predicates (1998)

Cached

Download Links

by Catherine Dubois , Véronique Viguié Donzeau-Gouge
Citations:8 - 1 self

Active Bibliography

5 Induction Proofs with Partial Functions – Jürgen Giesl - 1998
12 Partial recursive functions in higher-order logic – Alexander Krauss - 2006
7 Another Look at Nested Recursion – Konrad Slind
4 Inductive invariants for nested recursion – Sava Krstić, John Matthews - 2003
5 Automatic Termination Analysis for Partial Functions Using Polynomial Orderings – Jürgen Brauburger - 1997
1 How to Compute the Domains of Partial Functions – Jürgen Brauburger - 1997
2 Proving partial correctness of partial functions – Jürgen Giesl - 1996
28 Termination Checking with Types – Andreas Abel - 1999
10 Termination analysis by inductive evaluation – Jürgen Brauburger, Jürgen Giesl - 1998
8 Termination analysis for functional programs – Jürgen Giesl, Christoph Walther, Jürgen Brauburger - 1998
12 foetus – Termination Checker for Simple Functional Programs – Andreas Abel - 1998
10 Treating partiality in a logic of total functions – Olaf Müller, Konrad Slind - 1997
3 Recursive functions with higher order domains – Ana Bove, Venanzio Capretta - 2005
Verification of Mutual Recursive Functional Programs – Nikolaj Popov, Tudor Jebelean
1 Verification of Functional Programs Containing Nested Recursion – Nikolaj Popov, Tudor Jebelean
1 Isomorphisms - A Link Between the Shallow and the Deep – Thomas Santen, Fachbereich Informatik - 1999
1 Towards a Higher Reasoning Level in Formalized Homological Algebra – Jesus Aransay, Clemens Ballarin, Julio Rubio - 2003
Hardware Design and Theorem Proving – Jim Grundy, Intel Corporation, Tom Melham, Jim Grundy, Tom Melham
unknown title – Jim Grundy, Tom Melham