Theo: An interactive proof development system (Q688727): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Cambridge LCF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple consequence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using typed lambda calculus to implement formal systems on a machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The foundation of a generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632554 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01995105 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970894287 / rank
 
Normal rank

Latest revision as of 08:25, 30 July 2024

scientific article
Language Label Description Also known as
English
Theo: An interactive proof development system
scientific article

    Statements

    Theo: An interactive proof development system (English)
    0 references
    0 references
    0 references
    28 November 1993
    0 references
    The paper presents the main features of THEO, the first Typol version of a new tactic driven theorem prover which aims to help the user in building appropriate proofs in an object logic by proving theorems or derived rules in a backward way using resolution rule. The whole formalism used here, is essentially based on Gentzen sequent system. The resolution rule is expressed as a pair of Typol rules which describe the proof step when an inference rule is applied to the currently processed sequent. The basic implemented tactics, all of them being valid tactics, allow the user to add any number of previous derived rules and to ask for application of a particular instantiation of an object inference rule. Some editing manipulations as cut and paste transform can be applied to the derived proofs. The execution of the program can be controlled using the debugging facilities offered by Typol. Some examples of object logics which are already implemented under the described system are presented in the final part of the paper. A series of comments about some related work and conclusion remarks are formulated here too.
    0 references
    logics and meaning of programs
    0 references
    symbolic computation
    0 references
    theorem proving
    0 references
    proof theory
    0 references
    tactic driven theorem prover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references