Complete proof systems for algebraic simply-typed terms

We show that reasoning by case analysis (on whether subprograms diverge or converge) is complete for proving PCF observational congruences of algebraic terms. The latter are applicative combinations of first-order variables and a constant Ω denoting a diverging program of base type. A restricted ver...

Full description

Saved in:
Bibliographic Details
Published in:LFP, 94: Conference on LISP and Functional Programming 94: Conference on LISP and Functional Programming, 1994-07, Vol.VII (3), p.220-226
Main Author: Cosmadakis, Stavros S.
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that reasoning by case analysis (on whether subprograms diverge or converge) is complete for proving PCF observational congruences of algebraic terms. The latter are applicative combinations of first-order variables and a constant Ω denoting a diverging program of base type. A restricted version of the logic is complete for proving equality of algebraic terms in the full continuous type hierarchy (equivalently, observational congruence in PCF with parallel conditional). We show that the provability in the latter logic is in co-NP. We also give complete equational proof systems for a subclass of algebraic terms; provability in these systems is in linear time.
ISSN:1045-3563
DOI:10.1145/182590.182482