|
586
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
|
792
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Randal E Bryant
- 1992
|
|
2605
|
Graph-based algorithms for Boolean function manipulation
– Randal E. Bryant
- 1986
|
|
11
|
Reflecting BDDs in Coq
– Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar
- 2000
|
|
7
|
Another Look at Nested Recursion
– Konrad Slind
|
|
26
|
Reasoning about terminating functional programs
– K Slind
- 1999
|
|
30
|
Modelling General Recursion in Type Theory
– Ana Bove, Venanzio Capretta
- 2002
|
|
38
|
Termination of Nested and Mutually Recursive Algorithms
– Jürgen Giesl
- 1996
|
|
8
|
Correctness Proof of a BDD Manager in the Context of Satisfiability Checking
– Rob Sumners
- 2000
|
|
19
|
A verification environment for sequential imperative programs in Isabelle/HOL
– Norbert Schirmer
- 2005
|
|
5
|
Function de in higher order logic
– K Slind
- 1996
|
|
3
|
Recursive function de over coinductive types
– J Matthews
- 1999
|
|
8
|
Treating partiality in a logic of total functions
– Olaf Müller, Konrad Slind
- 1997
|
|
8
|
Fonctions récursives générales par itération en théorie des types
– A Balaa, Y Bertot
- 2002
|
|
14
|
Proving Termination of Normalization Functions for Conditional Expressions
– Lawrence C Paulson
- 1986
|
|
12
|
A Mechanical Proof of the Termination of Takeuchi's Function
– J Moore
- 1979
|
|
202
|
The Formal Semantics of Programming Languages: An Introduction
– G Winskel
- 1993
|
|
7
|
Finite Axiomatizations of Inductive and Inductive-Recursive Definitions
– Peter Dybjer, Anton Setzer
- 1998
|
|
6
|
Towards Animation of Proofs --testing proofs by examples--
– Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii
|
