Proofs About Lists Using Ellipsis

Authors:
Alan Bundy;Julian Richardson
Affiliations:
-;-
Venue:
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Year:
1999

Citing 6
Cited 3

An introduction to the theory of lists

Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
Models of inductive synthesis

Journal of Logic Programming
Triple Dots in a Formal Language

Journal of Automated Reasoning
The Use of Explicit Plans to Guide Inductive Proofs

Proceedings of the 9th International Conference on Automated Deduction
The Oyster-Clam System

Proceedings of the 10th International Conference on Automated Deduction
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction

Minimally strict polymorphic functions

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Proving properties about functions on lists involving element tests

WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Tentative experiments with ellipsis in mizar

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.01

Visualization

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 λClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, sind to display using the familicir... notation.