Program Extraction in Simply-Typed Higher Order Logic
- 15 April 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Object-Oriented Technology ECOOP 2002 Workshop ReaderLecture Notes in Computer Science, 2002
- The 5 Colour Theorem in Isabelle/IsarPublished by Springer Nature ,2002
- Refined program extraction from classical proofsAnnals of Pure and Applied Logic, 2002
- Executing Higher Order LogicPublished by Springer Nature ,2002
- A Higher-order Interpretation of Deductive TableauJournal of Symbolic Computation, 2001
- The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program ExtractionJournal of Automated Reasoning, 2001
- Proof Terms for Simply Typed Higher Order LogicPublished by Springer Nature ,2000
- Proof Theory at Work: Program Development in the Minlog SystemPublished by Springer Nature ,1998
- Program extraction in a Logical Framework settingPublished by Springer Nature ,1994
- Deliverables: a categorical approach to program development in type theoryPublished by Springer Nature ,1993