Results 1  10
of
14
The TYPELAB Specification and Verification Environment
 In Proceedings of AMAST'96
, 1996
"... Introduction Typelab is an experimental environment that permits the specification of software and hardware systems in a modular fashion. Modules are firstclass objects that can be manipulated in different ways, for example through refinement in a stepwise process. A high degree of abstraction and ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Introduction Typelab is an experimental environment that permits the specification of software and hardware systems in a modular fashion. Modules are firstclass objects that can be manipulated in different ways, for example through refinement in a stepwise process. A high degree of abstraction
Elaboration and Erasure in Type Theory
"... This thesis contributes to the construction of a convenient specification language on top of a type theoretic substrate. The subject arose in the context of the Typelab project that aimed at improving the machine assistance for the formal development of mathematics, software and hardware. Type theor ..."
Abstract
 Add to MetaCart
This thesis contributes to the construction of a convenient specification language on top of a type theoretic substrate. The subject arose in the context of the Typelab project that aimed at improving the machine assistance for the formal development of mathematics, software and hardware. Type
Dependently Typed Functional Programs and their Proofs
, 1999
"... Research in dependent type theories [ML71a] has, in the past, concentrated on its use in the presentation of theorems and theoremproving. This thesis is concerned mainly with the exploitation of the computational aspects of type theory for programming, in a context where the properties of programs ..."
Abstract

Cited by 85 (13 self)
 Add to MetaCart
Research in dependent type theories [ML71a] has, in the past, concentrated on its use in the presentation of theorems and theoremproving. This thesis is concerned mainly with the exploitation of the computational aspects of type theory for programming, in a context where the properties of programs may readily be specified and established. In particular, it develops technology for programming with dependent inductive families of datatypes and proving those programs correct. It demonstrates the considerable advantage to be gained by indexing data structures with pertinent characteristic information whose soundness is ensured by typechecking, rather than human effort. Type theory traditionally presents safe and terminating computation on inductive datatypes by means of elimination rules which serve as induction principles and, via their associated reduction behaviour, recursion operators [Dyb91]. In the programming language arena, these appear somewhat cumbersome and give rise to unappealing code, complicated by the inevitable interaction between case analysis on dependent types and equational reasoning on their indices which must appear explicitly in the terms. Thierry Coquand’s proposal [Coq92] to equip type theory directly with the kind of
Proof Theory At Work: Program Development In The Minlog System
, 1998
"... INTRODUCTION The old idea that proofs are in some sense functions, has been made precise by the CurryHowardcorrespondence between proofs in natural deduction and terms in typed lcalculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpreta ..."
Abstract

Cited by 29 (12 self)
 Add to MetaCart
INTRODUCTION The old idea that proofs are in some sense functions, has been made precise by the CurryHowardcorrespondence between proofs in natural deduction and terms in typed lcalculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proofs as functional programs. This concept and related ones going back to work of Gentzen, Gödel, Kleene and Kreisel are implemented in MINLOG, an interactive proof system designed for generating proof terms and exploring their algorithmic content. Besides tools for interactive proof generation, MINLOG has automatic devices \Gamma to search for purely logical (sub)proofs, \Gamma to check the correctness of a proof, \Gamma to remove detours in a proof, \Gamma to make a nonconstructive proof constructive, \Gamma to read off witnesses from a constructive pro
CADE15  The 15th International Conference on Automated Deduction July 510, 1998, Lindau, Germany  Integration of Deductive Systems
, 1998
"... This paper highlights a project to integrate interactive and automated theorem proving in Software Verification. Its aim is to combine the advantages of the two paradigms. We focus on one particular application domain, which is deduction for the purpose of software verification. We report on the int ..."
Abstract
 Add to MetaCart
This paper highlights a project to integrate interactive and automated theorem proving in Software Verification. Its aim is to combine the advantages of the two paradigms. We focus on one particular application domain, which is deduction for the purpose of software verification. We report
Universität Ulm
, 1999
"... This dissertation is concerned with interactive proof construction and automated proof search in type theories, in particular the Calculus of Constructions and its subsystems. Type theoriescan be conceived asexpressive logicswhich combine a functional programming language, strong typing and a higher ..."
Abstract
 Add to MetaCart
higherorder logic. They are therefore a suitable formalism for specification and verification systems. However, due to their expressiveness, it is difficult to provide appropriate deductive support for type theories. This dissertation first examines general methods for proof construction in type
Structuring and Using a Knowledge Base of Mathematical Concepts: A TypeTheoretic Approach
, 1996
"... This paper describes an approach to representing mathematical concepts in a knowledge base which is structured by a subsumption relation between concepts. Two kinds of concepts are examined: Propositional concepts, with the subsumption relation given by a generalized implication, and parameterized t ..."
Abstract
 Add to MetaCart
This paper describes an approach to representing mathematical concepts in a knowledge base which is structured by a subsumption relation between concepts. Two kinds of concepts are examined: Propositional concepts, with the subsumption relation given by a generalized implication, and parameterized theories, with the subsumption relation given by theory morphisms. It is shown which kinds of reasoning activities can be supported by such a knowledge base. A type theory in which the entities to be represented are firstclass objects serves as formal framework.
Background Superconducting Technology Assessment Letter of Promulgation
, 2005
"... This Superconducting Technology Assessment (STA) has been conducted by the National Security Agency to address the fundamental question of a potential replacement for silicon complementary metal oxide semiconductor (CMOS) in very highend computing (HEC) environments. Recent industry trends clearly ..."
Abstract
 Add to MetaCart
This Superconducting Technology Assessment (STA) has been conducted by the National Security Agency to address the fundamental question of a potential replacement for silicon complementary metal oxide semiconductor (CMOS) in very highend computing (HEC) environments. Recent industry trends clearly
Dagstuhl Seminar on Deduction
, 1995
"... of Panel Discussion at Dagstuhl Meeting on Deduction: Mining Proof Attempts for Logical Structure 4 A Reduction Ordering for HigherOrder Terms Jurgen Avenhaus, Carlos Lor'iaS'aenz, and Joachim Steinbach Universitat Kaiserslautern We investigate one of the classical problems of the ..."
Abstract
 Add to MetaCart
and functional programs are represented by means of executable specifications essentially consisting of ...
BENL, BERGER, SCHWICHTENBERG, SEISENBERGER, ZUBER PROOF THEORY AT WORK: PROGRAM DEVELOPMENT IN THE MINLOG SYSTEM
"... The old idea that proofs are in some sense functions, has been made precise by the CurryHowardcorrespondence between proofs in natural deduction and terms in typed λcalculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proof ..."
Abstract
 Add to MetaCart
The old idea that proofs are in some sense functions, has been made precise by the CurryHowardcorrespondence between proofs in natural deduction and terms in typed λcalculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proofs
Results 1  10
of
14