Sciweavers

80 search results - page 5 / 16
» Program Extraction from Normalization Proofs
Sort
View
KBSE
1999
IEEE
14 years 1 months ago
An ML Editor Based on Proofs-As-Programs
CYNTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of CYNTHIA edit...
Jon Whittle, Alan Bundy, Richard J. Boulton, Helen...
SIGADA
2005
Springer
14 years 2 months ago
Optimizing the SPARK program slicer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
Ricky E. Sward, Leemon C. Baird III
CSL
2007
Springer
14 years 3 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
TABLEAUX
2009
Springer
14 years 1 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
IFIP
2004
Springer
14 years 2 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack