Extracting information from intermediate semiconstructive HA-systems – extended abstract

Authors:
Mauro Ferrari;Camillo Fiorentini;Pierangelo Miglioli
Affiliations:
Università degli Studi di Milano, Dipartimento di Scienze dell'Informazione, via Comelico 39, 20135 Milano, Italy;Università degli Studi di Milano, Dipartimento di Scienze dell'Informazione, via Comelico 39, 20135 Milano, Italy;Università degli Studi di Milano, Dipartimento di Scienze dell'Informazione, via Comelico 39, 20135 Milano, Italy
Venue:
Mathematical Structures in Computer Science
Year:
2001

Citing 3
Cited 1

Type theory and functional programming

Type theory and functional programming
Abstract parametric classes and abstract data types defined by classical and constructive logical methods

Journal of Symbolic Computation
Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types

TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming

A Formal Framework for Synthesis and Verification of Logic Programs

LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this abstract we will describe research in progress on the problem of extracting information from proofs. Here we will concentrate our attention on semiconstructive calculi, which is a kind of calculus that is of interest in the framework of program synthesis and formal verification. We will discuss the notion of uniformly semiconstructive calculus, introduce our information extraction mechanism and apply it to two calculi extending Intuitionistic Arithmetic.