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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 272, Issue 1-2, 2002, Pages 41-68

Inductive-data-type systems

(3) Blanqui, Frédéric a Jouannaud, Jean Pierre a Okada, Mitsuhiro b

a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur (France)

b KEIO UNIVERSITY (Japan)

Author keywords

Higher order rewriting; Inductive types; Recursive definitions; Strong normalization; Typed lambda calculus

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

ALGEBRAIC SPECIFICATION LANGUAGES;

FORMAL LANGUAGES;

EID: 0037028509 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00347-9 Document Type: Conference Paper

Times cited : (57)

References (52)

1
- 21144483037
- Combining first and higher order rewrite systems with type assignment systems
- Proc. 1st Internat. Conf. on Typed Lambda Calculi and Applications, Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.664
- Barbanera, F.¹ Fernández, M.²

2
- 84951150270
- ω
- Proc. 20th Internat. Colloq. on Automata, Languages, and Programming, Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.700
- Barbanera, F.¹ Fernández, M.²

3
- 0027929033
- Modularity of strong normalization and confluence in the algebraic-λ-cube
- IEEE Computer Society
- (1994) Proc. 9th Symp. on Logic in Computer Science
- Barbanera, F.¹ Fernández, M.² Geuvers, H.³

4
- 0001439401
- Lambda calculi with types
- S. Abramski, D.M. Gabbai, T.S.E. Maiboum (Eds.), Oxford University Press, Oxford
- (1992) Handbook of Logic in Computer Science , vol.2
- Barendregt, H.¹

5
- 84937441577
- Termination and confluence of higher-order rewrite systems
- Proc. 11th Internat. Conf. on Rewriting Techniques and Applications
- (2000) Lecture Notes in Computer Science
- Blanqui, F.¹

6
- 84957655853
- The calculus of algebraic constructions
- Proc. 10th Internat. Conf. on Rewriting Techniques and Applications, Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1631
- Blanqui, F.¹ Jouannaud, J.-P.² Okada, M.³

7
- 0002235894
- Specification and proof in membership equational logic
- (1999) Theoret. Comput. Sci. , vol.236
- Bouhoula, A.¹ Jouannaud, J.-P.² Meseguer, J.³

8
- 0024130791
- Combining algebra and higher-order types
- IEEE Computer Society
- (1988) Proc. 3rd Symp. on Logic in Computer Science
- Breazu-Tannen, V.¹

9
- 84976856364
- Polymorphic rewriting conserves algebraic strong normalization
- Proc. 16th Internat. Colloq. on Automata, Languages, and Programming, Springer, Berlin
- (1989) Lecture Notes in Computer Science , vol.372
- Breazu-Tannen, V.¹ Gallier, J.²

10
- 0026173872
- Polymorphic rewriting conserves algebraic strong normalization
- (1991) Theoret. Comput. Sci. , vol.83 , Issue.1
- Breazu-Tannen, V.¹ Gallier, J.²

11
- 0004060205
- (1997) Tree automata techniques and applications
- Comon, H.¹ Dauchet, M.² Gilleron, R.³ Jacquemard, F.⁴ Lugiez, D.⁵ Tison, S.⁶ Tommasi, M.⁷

12
- 0006895609
- Chalmers University of Technology, Sweden
- (1992) Pattern matching with dependent types, Proc. 3rd Work. on Types for Proofs and Programs
- Coquand, T.¹

13
- 85025498813
- Constructions: A higher order proof system for mechanizing mathematics
- Proc. 1985 European Conf. on Computer Algebra, Springer, Berlin
- (1985) Lecture Notes in Computer Science , vol.203
- Coquand, T.¹ Huet, G.²

14
- 0001862486
- Inductively defined types
- Proc. 1988 Internat. Conf. on Computer Logic, Springer, Berlin
- (1988) Lecture Notes in Computer Science , vol.417
- Coquand, T.¹ Paulin-Mohring, C.²

15
- 0002219923
- The mathematical language Automath, its usage, and some of its extensions
- Proc. Symp. on Automatic Demonstration, Springer, Berlin
- (1970) Lecture Notes in Computer Science , vol.125
- De Bruijn, N.¹

16
- 0003335301
- Selected papers on automath
- North-Holland, Amsterdam
- (1994) Studies in Logic , vol.133
- Nederpelt, R.P.¹ Geuvers, J.H.² De Vrijer, R.C.³

17
- 0003947113
- Rewrite systems, in: J. van Leeuwen (Ed.), chapter 6: Rewrite Systems, North-Holland, Amsterdam
- (1990) Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics , vol.B
- Dershowitz, N.¹ Jouannaud, J.-P.²

18
- 0006941236
- INRIA, France
- (1998) Theorem proving modulo, Tech. Report , vol.3400
- Dowek, G.¹ Hardin, T.² Kirchner, C.³

19
- 84867829937
- INRIA, France
- (1998) Proof normalization modulo, Tech. Report , vol.3542
- Dowek, G.¹ Werner, B.²

20
- 0002069980
- On Girard's "Candidats de Réductibilité"
- P.-G. Odifreddi (Ed.), North-Holland, Amsterdam
- (1990) Logic and Computer Science
- Gallier, J.¹

21
- 0004532616
- Codifying guarded definitions with recursion schemes
- Proc. 5th Work. on Types for Proofs and Programs, Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.996
- Giménez, E.¹

22
- 84878591537
- Structural recursive definitions in type theory
- Proc. 25th Internat. Colloq. on Automata, Languages, and Programming, Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1443
- Giménez, E.¹

23
- 77956953346
- Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types
- J.E. Fenstad (Ed.), North-Holland, Amsterdam
- (1971) Proc. 2nd Scandinavian Logic Symp., of Studies in Logic and the Foundations of Mathematics , vol.63
- Girard, J.-Y.¹

24
- 0004099873
- Ph.D. Thesis, Université Paris VII, France
- (1972) Interprétation fonctionelle et élimination des coupures dans l'arithmetique d'ordre supérieur
- Girard, J.-Y.¹

25
- 0003432047
- Cambridge University Press, Cambridge
- (1988) Proofs and Types
- Girard, J.-Y.¹ Lafont, Y.² Taylor, P.³

26
- 0348250878
- M. Davis (Ed.), The Undecidable, Raven Press, New York
- (1965) On intuitionistic arithmetic and number theory
- Gödel, K.¹

27
- 0006983053
- Master's Thesis, Keio University, Japan, in Japanese
- (2000) On extensions of Gödel's System T
- Hasebe, K.¹

28
- 0006947106
- Executable higher-order algebraic specification languages
- IEEE Computer Society
- (1991) Proc. 6th Symp. on Logic in Computer Science
- Jouannaud, J.-P.¹ Okada, M.²

29
- 0031074199
- Abstract data type systems
- (1997) Theoret. Comput. Sci. , vol.173 , Issue.2
- Jouannaud, J.-P.¹ Okada, M.²

30
- 0032597493
- The higher-order recursive path ordering
- IEEE Computer Society
- (1999) Proc. 14th Symp. on Logic in Computer Science
- Jouannaud, J.-P.¹ Rubio, A.²

31
- 0004257495
- Ph.D. Thesis, University of Utrecht, Netherlands, Published as Mathematical Center Tract 129
- (1980) Combinatory reduction systems
- Klop, J.W.¹

32
- 0027910814
- Combinatory reduction systems: Introduction and survey
- (1993) Theoret. Comput. Sci. , vol.121 , Issue.1-2
- Klop, J.W.¹ Van Oostrom, V.² Van Raamsdonk, F.³

33
- 77956954781
- An intuitionistic theory of types: Predicative part
- H.E. Rose, J.C. Shepherdson (Eds.), North-Holland, Amsterdam
- (1975) Proc 73' Logic Colloq., Studies in Logic and the Foundations of Mathematics , vol.80
- Martin-Löf, P.¹

34
- 0003882263
- Bibliopolis, Napels
- (1984) Intuitionistic Type Theory
- Martin-Löf, P.¹

35
- 0002569005
- Higher-order rewrite systems and their confluence
- (1998) Theoret. Comput. Sci. , vol.192
- Mayr, R.¹ Nipkow, T.²

36
- 4244201333
- Tech. Report TR 86-764, Cornell University, United States
- (1986) First- and second-order lambda calculi with recursive types
- Mendler, N.P.¹

37
- 0003872629
- Ph.D. Thesis, Cornell University, United States
- (1987) Inductive definition in type theory
- Mendler, N.P.¹

38
- 0013212455
- A logic programming language with lambda-abstraction, function variables, and simple unification
- Proc. 1989 Internat. Work. on Extensions of Logic Programming, Springer, Berlin
- (1989) Lecture Notes in Computer Science , vol.475
- Miller, D.¹

39
- 0006990686
- Master's Thesis, Université Paris-Sud, France
- (1997) Automates de formes normales et réductibilité Inductive
- Monate, B.¹

40
- 0026191418
- Higher-order critical pairs
- IEEE Computer Society
- (1991) Proc. 6th Symp. on Logic in Computer Science
- Nipkow, T.¹

41
- 85028762708
- Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system
- ACM Press, New York
- (1989) Proc. 1989 Internat. Symp. on Symbolic and Algebraic Computation
- Okada, M.¹

42
- 0006983647
- A note on rewriting theory for uniqueness of iteration
- (2000) Theory Appl. Categories , vol.6 , Issue.4
- Okada, M.¹ Scott, P.J.²

43
- 0003521867
- Ph.D. Thesis, Technische Universität München, Germany
- (1995) Solving higher-order equations: from logic to programming
- Prehofer, C.¹

44
- 85029507128
- Linear unification of higher-order patterns
- Proc. 7th Internat. Joint Conf. CAAP/FASE on Theory and Practice of Software Development, Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.668
- Qian, Z.¹

45
- 0006901419
- Verifying process algebra proofs in type theory
- Workshops in Computing
- (1993) Proc. Internat. Work. on Semantics of Specification Languages
- Sellink, M.P.A.¹

46
- 0003818635
- D. Reidel, Dordrecht
- (1972) Combinators, Lambda-Terms and Proof Theory
- Stenlund, S.¹

47
- 0001748856
- Intensional interpretations of functionals of finite type I
- (1967) J. Symbolic Logic , vol.32 , Issue.2
- Tait, W.W.¹

48
- 0023345304
- Counterexamples to terminating for the direct sum of term rewriting systems
- (1986) Inform. Process. Lett. , vol.25 , Issue.3
- Toyama, Y.¹

49
- 0006947581
- Termination proofs for higher-order rewrite systems
- Proc. 1st Internat. Work. on Higher-Order Algebra, Logic and Term Rewriting, Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.816
- Van de Pol, J.¹

50
- 0004100598
- Ph.D. Thesis, Vrije Universiteit, Netherlands
- (1994) Confluence for abstract and higher-order rewriting
- Van Oostrom, V.¹

51
- 0004112348
- Ph.D. Thesis, Vrije Universiteit, Netherlands
- (1996) Confluence and normalization for higher-order rewriting
- Van Raamsdonk, F.¹

52
- 0003598370
- Ph.D. Thesis, Université Paris VII, France
- (1994) Une Théorie des Constructions Inductives
- Werner, B.¹

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