- Abstract:
- In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the LambdaClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, and to display using the familiar ... notation.
- Links To Paper
- No links available
- Bibtex format
- @Misc{EDI-INF-RR-0003,
- author = {
Alan Bundy
and Julian Richardson
},
- title = {Proofs About Lists Using Ellipsis},
- year = 1999,
- month = {Sep},
- }
|