SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Annals of Pure and Applied Logic

Volumn 114, Issue 1-3, 2002, Pages 3-25

Refined program extraction from classical proofs

(3) Berger, Ulrich a Buchholz, Wilfried b Schwichtenberg, Helmut b

a SWANSEA UNIVERSITY (United Kingdom)

b UNIVERSITY OF MUNICH (Germany)

Author keywords

A translation; Definite formula; Program extraction

Indexed keywords

EID: 0037089738 PISSN: 01680072 EISSN: None Source Type: Journal
DOI: 10.1016/S0168-0072(01)00073-2 Document Type: Article

Times cited : (50)

References (19)

1
- 84968335869
- Extracting constructive content from classical logic via control-like reductions
- M. Bezem, J.F. Groote (Eds.), Springer, Berlin
- (1993) Typed Lambda Calculi and Applications, Lecture Notes in Computer Science , vol.664 , pp. 45-59
- Barbanera, F.¹ Berardi, S.²

2
- 0008073096
- Programs from classical proofs
- M. Behara, R. Fritsch, R.G. Lintz (Eds.), Munich, Germany, August 2-7, 1993, Walter de Gruyter, Berlin
- (1995) Symposia Gaussiana, Proc. 2nd Gauss Symp., Conf. A: Mathematics and Theoretical Physics , pp. 187-200
- Berger, U.¹

3
- 84957653860
- Program extraction from classical proofs
- D. Leivant (Ed.), International Workshop LCC'94, Indianapolis, IN, USA, October 1994, Lecture Notes in Computer Science, Springer, Berlin
- (1995) Logic and Computational Complexity , vol.960 , pp. 77-97
- Berger, U.¹ Schwichtenberg, H.²

4
- 0035252984
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
- (2001) J. Automat. Reason , vol.26 , pp. 205-221
- Berger, U.¹ Schwichtenberg, H.² Seisenberger, M.³

5
- 0002476022
- Finding computational content in classical proofs
- G. Huet, G. Plotkin (Eds.), Cambridge University Press, Cambridge
- (1991) Logical Frameworks , pp. 341-362
- Constable, R.L.¹ Murthy, C.²

6
- 70349930710
- Gröbner basis in type theory
- T. Altenkirch, W. Naraschewski, B. Reus (Eds.) Springer, New York
- (1999) Types for Proofs and Programs, Lecture Notes in Computer Science , vol.1657
- Coquand, T.¹ Persson, H.²

7
- 0000709547
- Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors
- (1913) Am. J. Math , vol.35 , pp. 413-422
- Dickson, L.E.¹

8
- 0023602624
- A syntactic theory of sequential control
- (1987) Theoret. Comput. Sci , vol.52 , pp. 205-237
- Felleisen, M.¹ Friedman, D.P.² Kohlbecker, E.³ Duba, B.F.⁴

9
- 0026913084
- The revised report on the syntactic theory of sequential control and state
- (1992) Theoret. Comput. Sci , vol.102 , pp. 235-271
- Felleisen, M.¹ Hieb, R.²

10
- 0001796972
- Classically and intuitionistically provably recursive functions
- D.S. Scott, G.H. Müller (Eds.), Springer, Berlin
- (1978) Higher Set Theory, Lecture Notes in Mathematics , vol.669 , pp. 21-28
- Friedman, H.¹

11
- 0025211131
- A formulae-as-types notion of control
- (1990) Conf. Record 17th Annu. ACM Symp. on Principles of Programming Languages , pp. 47-58
- Griffin, T.G.¹

12
- 0001154964
- Analysing proofs in analysis
- W. Hodges, M. Hyland, C. Steinhorn, J. Truss (Eds.), European Logic Colloquium (Keele, 1993), Oxford University Press, Oxford
- (1996) Logic: From Foundations to Applications , pp. 225-260
- Kohlenbach, U.¹

13
- 4243128737
- Classical logic, storage operators and second-order lambda-calculus
- (1994) Ann. Pure Appl. Logic , vol.68 , pp. 53-78
- Krivine, J.-L.¹

14
- 0000275420
- Syntactic translations and provably recursive functions
- (1985) J. Symbolic Logic , vol.50 , Issue.3 , pp. 682-688
- Leivant, D.¹

15
- 0003834856
- Extracting constructive content from classical proofs
- Technical Report 90-1151, Ph.D. Thesis, Department of Computer Science, Cornell University, Ithaca, New York
- (1990)
- Murthy, C.¹

16
- 84944098890
- λμ-calculus: An algorithmic interpretation of classical natural deduction
- St. Petersburg, Lecture Notes in Computer Science, Springer, Berlin
- (1992) Proc. Log. Prog. Automatic Reasoning , vol.624 , pp. 190-201
- Parigot, M.¹

17
- 0003714780
- Springer, Berlin
- (1973) Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics , vol.344
- Troelstra, A.S.¹

18
- 4243495441
- North-Holland, Amsterdam
- (1988) Constructivism in Mathematics, An Introduction, Studies in Logic and the Foundations of Mathematics , vol.121-123
- Troelstra, A.S.¹ van Dalen, D.²

19
- 84963018658
- Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics
- (1993) J. London Math. Soc , vol.47 , pp. 193-211
- Bezem, M.¹ Veldman, W.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.