Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Razvan Diaconescu
- Inf. Comput.
- 2011

We develop a general logic-independent structural induction proof method at the level of abstract institutions. This provides a… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Andrew M. Pitts
- TPHOLs
- 2005

The <i>nominal</i> approach to abstract syntax deals with the issues of bound names and α-equivalence by considering… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Peter Buneman, Mary F. Fernández, Dan Suciu
- The VLDB Journal
- 2000

Abstract. This paper presents structural recursion as the basis of the syntax and semantics of query languages for… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Claudio Hermida, Bart Jacobs
- Inf. Comput.
- 1998

We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coin… (More)

Is this relevant?

1994

1994

- Claudio Hermida, Bart Jacobs
- CSL
- 1994

We propose a uniform, category-theoretic account of structural induction for inductively deened data types. The account is based… (More)

Is this relevant?

1993

1993

- Julia L. Lawall
- PEPM
- 1993

In this paper we show how partial evaluation can be used in developing proofs about program transformations. Partial evaluation… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Val Tannen, Peter Buneman, Shamim A. Naqvi
- DBPL
- 1991

We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Robert P. Kurshan, Kenneth L. McMillan
- PODC
- 1989

In verifying finite state systems such as communication protocols or hardware controllers, we may be required to reason about… (More)

Is this relevant?

1979

1979

- Raymond Aubin
- Theor. Comput. Sci.
- 1979

Inductive methods are basic to program proving and this paper presents the formal part of a theorem-proving system for autcmating… (More)

Is this relevant?

Highly Cited

1969

Highly Cited

1969

This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related… (More)

Is this relevant?