Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
30 hits
in 72,404,354 documents
in 0.24 seconds
Please leave the following field blank:
Home
»
Search: Monika Seisenberger
Hit List
Hit list
1.
Abstracts for Presentations Edited by
Open Access
Title:
Abstracts for Presentations Edited by
Author:
Magne Haveraaen
;
John Power
;
Monika Seisenberger
;
John Power
;
Monika Seisenberger
Magne Haveraaen
;
John Power
;
Monika Seisenberger
;
John Power
;
Monika Seisenberger
Minimize authors
Description:
CALCO brings together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. The study of algebra and coalgebra relates to the data, process and structural aspects of software systems. This is a highlevel, biannual conference f...
CALCO brings together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. The study of algebra and coalgebra relates to the data, process and structural aspects of software systems. This is a highlevel, biannual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). The first CALCO conference was held in Swansea, Wales, in 2005; the second takes place in Bergen, Norway. The CALCO Young Researchers Workshop, CALCOjnr, is a CALCO satellite event dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. Attendance at the workshop is open to all it is anticipated that many CALCO conference participants attend the CALCOjnr workshop (and vice versa). CALCOjnr presentations have been selected on the basis of submitted 2page abstracts, by the CALCOjnr PC. This booklet contains the abstracts of the accepted contributions. After the workshop, the author(s) of each presentation will be invited to submit a full 1015 page paper on the same topic. They will also be asked to write (anonymous) reviews of papers submitted by other authors on related topics. Additional reviewing and the final selection of papers will be carried out by the CALCOjnr PC. The volume of selected papers from the workshop will be published as a Department of Informatics, University of Bergen, technical report, and it will also be made available through the open access database
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://www.ii.uib.no/calco07/calcojnrp/calco07jnrabstracts.pdf
http://www.ii.uib.no/calco07/calcojnrp/calco07jnrabstracts.pdf
Minimize
Document Type:
text
Language:
en
DDC:
028 Reading & use of other information media
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.2729
http://www.ii.uib.no/calco07/calcojnrp/calco07jnrabstracts.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.2729
http://www.ii.uib.no/calco07/calcojnrp/calco07jnrabstracts.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Sponsoring Institutions Working Group 1.3: Foundations of System Specification The British Computer Society specialist group on Formal Aspects of Computer Science Preface
Open Access
Title:
Sponsoring Institutions Working Group 1.3: Foundations of System Specification The British Computer Society specialist group on Formal Aspects of Computer Science Preface
Author:
Peter Mosses
;
John Power
;
Monika Seisenberger
;
John Power
;
Monika Seisenberger
Peter Mosses
;
John Power
;
Monika Seisenberger
;
John Power
;
Monika Seisenberger
Minimize authors
Description:
and WADT – the Workshop on Algebraic Development Techniques, have joined their forces and reputations into a new highlevel biannual conference. Starting in 2005, CALCO brings together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in comput...
and WADT – the Workshop on Algebraic Development Techniques, have joined their forces and reputations into a new highlevel biannual conference. Starting in 2005, CALCO brings together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. The CALCO Young Researchers Workshop, CALCOjnr, was a CALCO 2005 satellite event dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. Attendance at the workshop was open to all – many CALCO conference participants attended the CALCOjnr workshop and vice versa. Overall, CALCOjnr received 23 submissions and had 37 participants. CALCOjnr presentations were selected according to originality, significance, and general interest, on the basis of 2page abstracts, by the organisers. After the workshop, the author(s) of each presentation were invited to submit a full 1015 page paper on the same topic. They were also asked to write (anonymous) reviews of papers submitted by other authors on related topics; further reviewing was provided mainly by members of the CALCO Programme Committee and of IFIP WG 1.3. This volume of selected papers from the workshop is published as a technical report at Swansea. Authors retain copyright, and are also encouraged to disseminate the results reported at CALCOjnr by subsequent publication elsewhere. The organisers of CALCOjnr would like to thank the workshop participants, the reviewers, and the CALCO 2005 organisers José Fiadeiro, Neal Harman, Markus Roggenbach, and Jan Rutten for their efforts to make this event a success. The support of the sponsoring institutions listed on the preceding page is
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://wwwcompsci.swan.ac.uk/~csmona/CALCOjnrProceedings.pdf
http://wwwcompsci.swan.ac.uk/~csmona/CALCOjnrProceedings.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.6189
http://wwwcompsci.swan.ac.uk/~csmona/CALCOjnrProceedings.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.6189
http://wwwcompsci.swan.ac.uk/~csmona/CALCOjnrProceedings.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Verification of railway interlockings in scade
Open Access
Title:
Verification of railway interlockings in scade
Author:
Andrew Lawrence
;
Monika Seisenberger
;
Andrew Lawrence
;
Monika Seisenberger
Andrew Lawrence
;
Monika Seisenberger
;
Andrew Lawrence
;
Monika Seisenberger
Minimize authors
Description:
Abstract: We present two modelling approaches for the application of model checking to verify railway interlockings. The first translates socalled Ladder Logic into Scade language, the second models a segment of railway from scratch. The verification tool used is Scade. Keywords: Verification, Model Checking, Scade, Dataflow, Lustre, Railway T...
Abstract: We present two modelling approaches for the application of model checking to verify railway interlockings. The first translates socalled Ladder Logic into Scade language, the second models a segment of railway from scratch. The verification tool used is Scade. Keywords: Verification, Model Checking, Scade, Dataflow, Lustre, Railway The aim of our research is to investigate the use of Scade Suite (Esterel Technologies) for the verification of railway interlockings. This is a feasibility study done in cooperation with Invensys Rail, a leading international company for the design, construction, and validation of railway control systems. We concentrate on the application of modelling and model checking [CGP99]; specifically we present the development of two different modelling approaches. In the first approach, we translate existing specifications written in socalled Ladder Logic into Scade and verify them. In the second, we model a segment of railway from scratch. We applied the first approach to two real world railway interlockings, however, for confidentially reasons, we can only demonstrate the method with a toy example. The track plan and control table of one of these two real world interlockings were simplified and led to the model considered in the second
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120509
Source:
http://cs.swan.ac.uk/%7Ecsal/AVOCS2010.pdf
http://cs.swan.ac.uk/%7Ecsal/AVOCS2010.pdf
Minimize
Document Type:
text
Language:
en
DDC:
000 Computer science, information & general works
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.5621
http://cs.swan.ac.uk/%7Ecsal/AVOCS2010.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.5621
http://cs.swan.ac.uk/%7Ecsal/AVOCS2010.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
an der Fakultät für Mathematik und Informatik der Ludwig–Maximilians–Universität München
Open Access
Title:
an der Fakultät für Mathematik und Informatik der Ludwig–Maximilians–Universität München
Author:
Monika Seisenberger
;
Monika Seisenberger
;
Monika Seisenberger
;
Erstgutachter Prof
;
Dr. H. Schwichtenberg
;
Zweitgutachter Prof
;
Dr. W. Buchholz
Monika Seisenberger
;
Monika Seisenberger
;
Monika Seisenberger
;
Erstgutachter Prof
;
Dr. H. Schwichtenberg
;
Zweitgutachter Prof
;
Dr. W. Buchholz
Minimize authors
Description:
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice principles. Special emphasis is put on optimizations that allow for the extraction of realistic programs. Our main field of application is infinita...
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice principles. Special emphasis is put on optimizations that allow for the extraction of realistic programs. Our main field of application is infinitary combinatorics. Higman’s Lemma, having an elegant nonconstructive proof due to NashWilliams, constitutes an interesting case for the problem of discovering the constructive content behind a classical proof. We give two distinct solutions to this problem. First, we present a proof of Higman’s Lemma for an arbitrary alphabet in a theory of inductive definitions. This proof may be considered as a constructive counterpart to NashWilliams ’ minimalbadsequence proof. Secondly, using a refined Atranslation method, we directly transform the classical proof into a constructive one and extract a program. The crucial point in the latter is that we do not need to avoid the axiom of classical dependent choice but directly assign a realizer to its translation. A generalization of Higman’s Lemma is Kruskal’s Theorem. We present a constructive proof of Kruskal’s Theorem that is completely formalized in a theory of inductive definitions. As a practical part, we show that these methods can be carried out in an interactive theorem prover. Both approaches to Higman’s Lemma have been implemented in Minlog. ii
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://edoc.ub.unimuenchen.de/1619/1/
seisenberger
_monika.pdf
http://edoc.ub.unimuenchen.de/1619/1/
seisenberger
_monika.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.5756
http://edoc.ub.unimuenchen.de/1619/1/seisenberger_monika.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.5756
http://edoc.ub.unimuenchen.de/1619/1/seisenberger_monika.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Proofs, Programs, Processes
Open Access
Title:
Proofs, Programs, Processes
Author:
Ulrich Berger
;
Monika Seisenberger
Ulrich Berger
;
Monika Seisenberger
Minimize authors
Description:
The objective of this paper is to provide a theoretical foundation for program extraction from inductive and coinductive proofs geared to practical applications. The novelties consist in the addition of inductive and coinductive definitions to a realizability interpretation for firstorder proofs, a soundness proof for this system, and applicati...
The objective of this paper is to provide a theoretical foundation for program extraction from inductive and coinductive proofs geared to practical applications. The novelties consist in the addition of inductive and coinductive definitions to a realizability interpretation for firstorder proofs, a soundness proof for this system, and applications to the synthesis of nontrivial provably correct programs in the area of exact real number computation. We show that realizers, although per se untyped, can be assigned polymorphic recursive types and hence represent valid programs in a lazy functional programming language such as Haskell. Programs extracted from proofs using coinduction can be understood as perpetual processes producing infinite streams of data. Typical applications of such processes are computations in exact real arithmetic. As an example we show how to extract a program computing the average of two real numbers w.r.t. the binary signed digit representation.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20140617
Source:
http://link.springer.com/content/pdf/10.1007/s0022401193258.pdf
http://link.springer.com/content/pdf/10.1007/s0022401193258.pdf
Minimize
Document Type:
text
Language:
en
DDC:
005 Computer programming, programs & data
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.3048
http://link.springer.com/content/pdf/10.1007/s0022401193258.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.3048
http://link.springer.com/content/pdf/10.1007/s0022401193258.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Proofs, programs, processes
Open Access
Title:
Proofs, programs, processes
Author:
Ulrich Berger
;
Monika Seisenberger
Ulrich Berger
;
Monika Seisenberger
Minimize authors
Description:
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming language such as Haskell. Programs extracted from...
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming language such as Haskell. Programs extracted from proofs using coinduction can be understood as perpetual processes producing infinite streams of data. Typical applications of such processes are computations in exact real arithmetic. As an example we show how to extract a program computing the average of two real numbers w.r.t. to the binary signed digit representation. 1
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20110415
Source:
http://wwwcompsci.swan.ac.uk/%7Ecsulrich/ftp/cie10r.pdf
http://wwwcompsci.swan.ac.uk/%7Ecsulrich/ftp/cie10r.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2805
http://wwwcompsci.swan.ac.uk/%7Ecsulrich/ftp/cie10r.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2805
http://wwwcompsci.swan.ac.uk/%7Ecsulrich/ftp/cie10r.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
Applications of inductive definitions and choice principles to program synthesis
Open Access
Title:
Applications of inductive definitions and choice principles to program synthesis
Author:
Ulrich Berger
;
Monika Seisenberger
Ulrich Berger
;
Monika Seisenberger
Minimize authors
Description:
Abstract. We describe two methods of extracting constructive content from classical proofs, focusing on theorems involving infinite sequences and nonconstructive choice principles. The first method removes any reference to infinite sequences and transforms the theorem into a system of inductive definitions, the other applies a combination of Göd...
Abstract. We describe two methods of extracting constructive content from classical proofs, focusing on theorems involving infinite sequences and nonconstructive choice principles. The first method removes any reference to infinite sequences and transforms the theorem into a system of inductive definitions, the other applies a combination of Gödel’s negativeand Friedman’s Atranslation. Both approaches are explained by means of a case study on Higman’s Lemma and its wellknown classical proof due to NashWilliams. We also discuss some prooftheoretic optimizations that were crucial for the formalization and implementation of this work in the interactive proof system Minlog. 1
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://wwwcompsci.swan.ac.uk/~csmona/claco.pdf
http://wwwcompsci.swan.ac.uk/~csmona/claco.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.9508
http://wwwcompsci.swan.ac.uk/~csmona/claco.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.9508
http://wwwcompsci.swan.ac.uk/~csmona/claco.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
Program extraction via typed realisability for induction and coinduction
Open Access
Title:
Program extraction via typed realisability for induction and coinduction
Author:
Ulrich Berger
;
Monika Seisenberger
Ulrich Berger
;
Monika Seisenberger
Minimize authors
Description:
and coinduction
and coinduction
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120319
Source:
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/Berger_Seisenberger.pdf
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/Berger_Seisenberger.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5783
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/Berger_Seisenberger.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5783
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/Berger_Seisenberger.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
An Inductive Version of NashWilliams’ MinimalBadSequence Argument for Higman’s Lemma
Open Access
Title:
An Inductive Version of NashWilliams’ MinimalBadSequence Argument for Higman’s Lemma
Author:
Monika Seisenberger
Monika Seisenberger
Minimize authors
Description:
Higman’s lemma has a very elegant, nonconstructive proof due to NashWilliams [NW63] using the socalled minimalbadsequence argument. The objective of the present paper is to give a proof that uses the same combinatorial idea, but is constructive. For a two letter alphabet this was done by Coquand and Fridlender [CF94]. Here we present a proo...
Higman’s lemma has a very elegant, nonconstructive proof due to NashWilliams [NW63] using the socalled minimalbadsequence argument. The objective of the present paper is to give a proof that uses the same combinatorial idea, but is constructive. For a two letter alphabet this was done by Coquand and Fridlender [CF94]. Here we present a proof in a theory of inductive definitions that works for arbitrary decidable well quasiorders.
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120620
Source:
http://wwwcompsci.swan.ac.uk/~csmona/articles/nashwilliams.pdf
http://wwwcompsci.swan.ac.uk/~csmona/articles/nashwilliams.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.1701
http://wwwcompsci.swan.ac.uk/~csmona/articles/nashwilliams.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.1701
http://wwwcompsci.swan.ac.uk/~csmona/articles/nashwilliams.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction
Open Access
Title:
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction
Author:
Ulrich Berger
;
Helmut Schwichtenberg
;
Monika Seisenberger
Ulrich Berger
;
Helmut Schwichtenberg
;
Monika Seisenberger
Minimize authors
Description:
. By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a path can always be avoided. Secondly, we extract...
. By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a path can always be avoided. Secondly, we extract a program from a classical (i.e. non constructive) proof of a special case of Dickson's Lemma, by transforming the classical proof into a constructive one. These techniques (as well as the examples) are implemented in the interactive theorem prover Minlog developed at the University of Munich. 1. Introduction The objective of this paper is to show that the method of extracting programs from proofs is not only a powerful metamathematical tool, but is also of considerable practical interest: used in a refined way it is applicable to rather involved proofs and yields concise and efficient programs which moreover are provably correct. We present .
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090413
Source:
http://www.mathematik.unimuenchen.de/~schwicht/papers/jar97/jar00.ps.Z
http://www.mathematik.unimuenchen.de/~schwicht/papers/jar97/jar00.ps.Z
Minimize
Document Type:
text
Language:
en
DDC:
005 Computer programming, programs & data
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5298
http://www.mathematik.unimuenchen.de/~schwicht/papers/jar97/jar00.ps.Z
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5298
http://www.mathematik.unimuenchen.de/~schwicht/papers/jar97/jar00.ps.Z
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(22) The Pennsylvania State University CiteSeerX...
(20) Monika Seisenberger
(11) Ulrich Berger
(8) Seisenberger, Monika
(7) Helmut Schwichtenberg
(4) John Power
(3) Berger, Ulrich
(3) Magne Haveraaen
(2) Andrew Lawrence
(2) Barnes, David J.
(2) Bibby, Pete
(2) Bown, James
(2) Bush, Vicky
(2) Campbell, Phil
(2) Carole Wagstaff
(2) Cutts, Quintin
(2) David Barnes
(2) Dermot Shinnerskennedy
(2) Dimitar Kazakov
(2) Fincher, Sally
(2) Jamieson, Stephan
(2) Jenkins, Tony
(2) Jim Bown
(2) Kazakov, Dimitar
(2) Lancaster, Thomas
(2) Mark Ratcliffe
(2) Michael Jones
(2) Peter Bibby
(2) Phil Campbell
(2) Quintin Cutts
(2) Ratcliffe, Mark
(2) Sally Fincher
(2) ShinnersKennedy, Dermot
(2) Stephan Jamieson
(2) Thomas Lancaster
(2) Tony Jenkins
(2) Vicky Bush
(2) Wagstaff, Carole
(2) White, Linda
(2) Whyley, Chris
(1) Anton Setzer
(1) Arnold Beckmann
(1) Birgit Elbl
(1) Chris Whyley
(1) Christopher Broadbent
(1) Cirstea, Corina
(1) Diener, Hannes
(1) Dr. H. Schwichtenberg
(1) Dr. W. Buchholz
(1) Erstgutachter Prof
(1) Forsberg, Fredrik Nordvall
(1) Hasuo, I.
(1) Haveraaen, Magne
(1) Herbstritt, Marc
(1) Jacobs, B.P.F.
(1) Jones, Michael D.
(1) Karlheinz Niggl
(1) Kenji Miyamoto
(1) Lawrence, Andrew
(1) Linda White
(1) Monika Seisenberger Preface
(1) Oliver Kullmann
(1) Peter Mosses
(1) Power, John
(1) Reinhard Kahle
(1) Schuster, Peter
(1) Sokolova, A.
(1) Ulrich Berger Helmut
(1) Ulrich Berger Monika Seisenberger
(1) Wilkinson, Toby
(1) Woods, Gregory J. M.
(1) Zweitgutachter Prof
Author:
Subject
(2) computer programming
(2) qa 76 software
(1) 000 computer science
(1) computer science
(1) computer science logic in computer science
(1) dpll
(1) fakultät für mathematik
(1) fast growing hierarchy
(1) general works
(1) informatics for technical applications
(1) informatik und statistik
(1) interactive theorem proving
(1) knowledge
(1) mathematics and statistics
(1) ordinal notation systems
(1) program extraction
(1) proof theory
(1) qa75 electronic computers computer science
(1) sat
(1) security of systems
(1) slow growing hierarchy
(1) subrecursive hierarchies
(1) teaching
Subject:
Dewey Decimal Classification (DDC)
(7) Computer science, knowledge & systems [00*]
(1) Library & information sciences [02*]
(1) Mathematics [51*]
Dewey Decimal Classification (DDC):
Year of Publication
(6) 2012
(5) 2008
(4) 2009
(4) 2013
(4) 2014
(2) 2006
(2) 2011
(1) 2003
(1) 2007
(1) 2015
Year of Publication:
Content Provider
(22) CiteSeerX
(2) Kent Univ.
(1) ArXiv.org
(1) DataCite Metadata Store
(1) Munich LMU: Digital theses
(1) Southampton Univ.: ePrints Soton
(1) Ghent Univ.
(1) Nijmegen Univ.
Content Provider:
Language
(26) English
(4) Unknown
Language:
Document Type
(24) Text
(2) Books
(2) Reports, Papers, Lectures
(1) Article, Journals
(1) Theses
Document Type:
Access
(23) Open Access
(7) Unknown
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3
Next »
New Search »
Currently in BASE: 72,404,354 Documents of 3,481
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,404,354 Documents of 3,481 Content Sources
http://www.basesearch.net