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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 285, Issue 2, 2002, Pages 487-517

Equational rules for rewriting logic

(1) Viry, Patrick a,b

a ASTEM RI (Japan)

b IBM (United States)

Author keywords

Building in equality; Coherence; Equational programming; Rewriting

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING; COMPUTER SCIENCE; SEMANTICS;

EQUATIONAL PROGRAMMING;

FORMAL LOGIC;

EID: 0037190150 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00366-8 Document Type: Article

Times cited : (94)

References (43)

1
- 38249012012
- AC-unification race: The system solving approach, implementation and benchmarks
- (1992) J. Symbolic Comput. , vol.14 , Issue.1 , pp. 51-70
- Adi, M.¹ Kirchner, C.²

2
- 0003650163
- Cambridge University Press Cambridge
- (1999) Term Rewriting and All That
- Baader, F.¹ Nipkow, T.²

3
- 0009907831
- λυ, A calculus of explicit substitutions which preserves strong normalisation
- INRIA, February
- (1995) Technical Report , vol.2477
- Benaissa, Z.¹ Briaud, D.² Lescanne, P.³ Rouyer-Degli, J.⁴

4
- 0022738654
- Conditional rewrite rules: Confluency and termination
- (1986) J. Comput. System Sci. , vol.32 , Issue.3 , pp. 323-362
- Bergstra, J.A.¹ Klop, J.W.²

5
- 0003086869
- Introduction to the ISO specification language LOTOS
- P.H.J. van Eijk, C.A. Vissers, M. Diaz (Eds.), Elsevier Science Publishers B.V., North-Holland
- (1989) The Formal Description Technique LOTOS , pp. 23-73
- Bolognesi, T.¹ Brinksma, E.²

6
- 0009908299
- Hierarchical contextual rewriting with several levels
- Cori R., Wirsing M.(Eds.) Springer Berlin, Bordeaux, France, Lecture Notes in Computer Science
- (1988) 5th Ann. Symp. on Theoretical Aspects of Computer Science , vol.294 , pp. 193-206
- Bousdira, W.¹ Rémy, J.-L.²

7
- 84957610021
- Using reflection to build efficient and certified decision procedures
- Abadi M., Ito T.(Eds.), Springer Berlin
- (1997) TACS'97, Lecture Notes in Computer Science , vol.1281
- Boutin, S.¹

8
- 0009957332
- Unification and disunification in shallow theories
- H. Comon (Ed.), Barbizon, France
- (1991) Proc. 5th Internat. Workshop on Unification
- Comon, H.¹ Jouannaud, J.-P.²

9
- 0003634526
- RR 1617, INRIA, Rocquencourt, February
- (1992) Confluence properties of weak and strong calculi of explicit substitutions
- Curien, P.-L.¹ Hardin, Th.² Lévy, J.-J.³

10
- 85034823126
- Confluence of conditional rewrite systems
- J.-P. Jouannaud, S. Kaplan(Eds.), Proc. 1st Internat. Workshop on Conditional Term Rewriting Systems, Springer Berlin, Orsay, France, July
- (1987) Lecture Notes in Computer Science , vol.308 , pp. 31-44
- Dershowitz, N.¹ Okada, M.² Sivakumar, G.³

11
- 0003407146
- Thèse de Doctorat d'Université, Université de Nancy 1, September
- (1991) Outils pour la déduction automatique dans les théories associatives-commutatives
- Domenjoud, E.¹

12
- 0009957972
- Higher-order unification via explicit substitutions
- D. Lugiez (Ed.), Val d'Ajol, France, CRIN, June
- (1994) Proc. 8th Internat. Workshop on Unification
- Dowek, G.¹ Hardin, Th.² Kirchner, C.³

13
- 0003754553
- Technical Report 3400, INRIA
- (1998) Theorem proving modulo
- Dowek, G.¹ Hardin, Th.² Kirchner, C.³

14
- 0009923945
- Coherence checker and completion tools for maude specifications
- Dpto. de Lenguajes y Ciencias de la Computation, Universidad de Málaga, Available from
- (2000) Technical report
- Durán, F.¹

15
- 84947939145
- Modular termination of term rewriting systems revisited
- Proc. of 11th Workshop on Specification of Abstract Data Types, Springer, Berlin
- (1995) Lecture Notes in Computer Science , vol.906
- Fernandez, M.¹ Jouannaud, J.-P.²

16
- 0003297091
- Proofs and types
- Cambridge University Press, Cambridge
- (1989) Cambridge Tracts in Theoretical Computer Science , vol.7
- Girard, J.-Y.¹ Lafont, Y.² Taylor, P.³

17
- 0003347217
- Introducing OBJ
- J.A. Goguen, G. Malcolm(Eds.), Kluwer Academic Publishers Dordrecht
- (2000) Software Engineering with OBJ: Algebraic Specification in Action , pp. 3-167
- Goguen, J.A.¹ Winkler, T.² Meseguer, J.³ Futatsugi, K.⁴ Jouannaud, J.-P.⁵

18
- 84957885521
- On termination and confluence of conditional rewrite systems
- Proc. 4th Internat. Workshop on Conditional and Typed Rewriting Systems (CTRS'94), Jerusalem, Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.968
- Gramlich, B.¹

19
- 0003358824
- A confluent calculus of substitutions
- Izu
- (1989) France-Japan Artificial Intelligence and Computer Science Symposium
- Hardin, Th.¹ Lévy, J.-J.²

20
- 17144412215
- Functional back-ends within the lambda-sigma calculus
- Philadelphia, Pennsylvania, May 24-26, SIGPLAN Notices June 1996, ACM Press, ISBN 0-89791-770-7
- (1996) Proceedings of ICFP 1996 , vol.31 , Issue.6
- Hardin, T.¹ Maranget, L.² Pagano, B.³

21
- 0018005391
- Communicating sequential processes
- (1978) Commun. ACM , vol.21 , Issue.8 , pp. 666-677
- Hoare, C.A.R.¹

22
- 84992070001
- On reduction-based process semantics
- Springer Berlin
- (1993) Proc. of 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science , vol.761 , pp. 371-387
- Honda, K.¹ Yoshida, N.²

23
- 0001686885
- Completion of a set of rules modulo a set of equations
- Preliminary version in Proc. 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, USA, 1984.
- (1984) SIAM J. Comput. , vol.15 , Issue.4 , pp. 1155-1194
- Jouannaud, J.-P.¹ Kirchner, H.²

24
- 0002563907
- Designing constraint programming languages using computational systems
- P. Van Hentenryck, S. Saraswat(Eds.), The MIT Press Cambridge, MA
- (1995) Principles and Practice of Constraint Programming
- Kirchner, C.¹ Kirchner, H.² Vittek, M.³

25
- 0028022237
- From λσ to λυ, a journey through calculi of explicit substitutions
- Hans Boehm (Ed.), Portland, OR, USA, ACM
- (1994) Proc. of the 21st Annual ACM Symposium on Principles of Programming Languages , pp. 60-69
- Lescanne, P.¹

26
- 0009934355
- The calculus of explicit substitutions λυ
- INRIA-Lorraine, January
- (1994) Technical Report RR-2222
- Lescanne, P.¹ Rouyer-Degli, J.²

27
- 4243759077
- Thèse de Doctorat d'Université, Université de Paris-Sud, Orsay, France, October
- (1993) Réécriture modulo une théorie présentée par un système convergent et décidabilité du problème du mot dans certaines classes de théories équationnelles
- Marché, C.¹

28
- 0028016680
- Normalised rewriting and normalised completion
- IEEE Computer Society Press Silverspring, MD
- (1994) Proc. 9th Symp. on Logic in Computer Science , pp. 394-403
- Marché, C.¹

29
- 0003712384
- Rewriting logic as a logical and semantic framework
- SRI International
- (1993) Technical report CSL-93-05
- Martí-Oliet, N.¹ Meseguer, J.²

30
- 0009908987
- The Maude system

31
- 0027113376
- Conditional rewriting logic as a unified model of concurrency
- (1992) Theoret. Comput. Sci. , vol.96 , Issue.1 , pp. 73-155
- Meseguer, J.¹

32
- 0002893365
- A logical theory of concurrent objects and its realisation in the Maude language
- G. Agha, P. Wegner, A. Yonezawa(Eds.), The MIT Press Cambridge, MA
- (1993) Research Directions in Object-Based Concurrency
- Meseguer, J.¹

33
- 0003566438
- Prentice-Hall Englewood Cliffs, NJ
- (1989) Communication and Concurrency, International Series in Computer Science
- Milner, R.¹

34
- 0003604327
- The polyadic π-calculus: A tutorial
- LFCS, University of Edinburgh
- (1991) Technical report ECS-LFCS-91-180
- Milner, R.¹

35
- 84976823860
- Complete sets of reductions for some equational theories
- (1981) J. ACM , vol.28 , pp. 233-264
- Peterson, G.¹ Stickel, M.E.²

36
- 0347899211
- Extension orderings
- Springer, Berlin
- (1995) Proc. of ICALP'95, Lecture Notes in Computer Science , vol.944
- Rubio, A.¹

37
- 0009953871
- Theorem proving modulo associativity
- Lecture Notes in Computer Science, Springer, Berlin
- (1995) Proc. of the Conference of the European Association for Computer Science Logic , vol.1092
- Rubio, A.¹

38
- 4243295428
- Thèse de Doctorat d'Université, Université de Nancy 1, October
- (1992) La réécriture concurrente
- Viry, P.¹

39
- 0001111462
- Rewriting: An effective model of concurrency
- Springer, Berlin
- (1994) Proc. of PARLE'94, Lecture Notes in Computer Science , vol.817
- Viry, P.¹

40
- 0003590726
- Rewriting Modulo a rewrite system
- Università di Pisa, available from
- (1995) Technical report TR-20/95
- Viry, P.¹

41
- 0003363397
- Input/output for ELAN
- J. Meseguer (Ed.), Proc. of 1st Internat. Workshop on Rewriting Logic and its Applications, Elsevier, Amsterdam
- (1996) Electronic Notes in Theoretical Computer Science , vol.4
- Viry, P.¹

42
- 0001150433
- Adventures in sequent calculus modulo equations
- J. Meseguer (Ed.), Proc. of 2nd International Workshop on Rewriting Logic and its Applications, Elsevier, Amsterdam
- (1998) Electronic Notes in Theoretical Computer Science , vol.15
- Viry, P.¹

43
- 0003913041
- Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, October
- (1994) ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes
- Vittek, M.¹

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