|
234
|
Ordering by divisibility in abstract algebras
– G Higman
- 1952
|
|
58
|
On well-quasi-ordering finite trees
– C S J A Nash-Williams
- 1963
|
|
16
|
A constructive proof of Higman’s lemma
– C R Murthy, J R Russell
- 1990
|
|
61
|
Extracting Constructive Content from Classical Proofs
– C Murthy
- 1990
|
|
5
|
Higman's Lemma in Type Theory
– Daniel Fridlender
- 1997
|
|
11
|
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen. (in German) [A theorem on finite sequences of natural numbers that is unprovable in pure number theory
– S Simpson, K Schütte
- 1985
|
|
51
|
Program extraction from classical proofs
– Ulrich Berger, Wilfried Buchholz
- 1994
|
|
19
|
Ordinal numbers and the Hilbert Basis Theorem
– S Simpson
- 1988
|
|
19
|
The Warshall Algorithm and Dickson’s Lemma: Two Examples of Realistic Program Extraction
– Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
|
|
824
|
Term Rewriting and All That
– F Baader, T Nipkow
- 1998
|
|
6
|
Program development by proof transformation
– U Berger, H Schwichtenberg
- 1993
|
|
8
|
The Greatest Common Divisor: A Case Study for Program Extraction From Classical Proofs
– U. Berger, H. Schwichtenberg
- 1996
|
|
2
|
can be obtained by anonymous ftp at the two Scheme Repositories, altdorf.ai.mit.edu and nexus.yorku.ca
– H Abelson, N I Adams D H Bartley, G Brooks, R K Dybvig, D P Friedman, R Halstead, C Hanson
- 1991
|
|
7
|
Troelstra (editor). Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
– S Anne
- 1973
|
|
12
|
Intuitionistische Untersuchungen der formalistischen Logik
– S Kuroda
- 1951
|
|
64
|
Continuation Semantics in Typed Lambda-Calculi
– Albert R. Meyer, Mitchell Wand
- 1985
|
|
206
|
A Formulae-as-Types Notion of Control
– Timothy G. Griffin
- 1990
|
|
105
|
A Syntactic Theory of Sequential Control
– M Felleisen, D P Friedman, E E Kohlbecker, B F Duba
- 1987
|
|
6
|
On the logical strength of Nash-Williams’ theorem on transfinite sequences
– Alberto Marcone
- 1996
|
