HOME > 상세정보

상세정보

Rewriting techniques and applications : 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995 : proceedings

Rewriting techniques and applications : 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995 : proceedings

자료유형
단행본
개인저자
Hsiang, Jieh, 1954-.
서명 / 저자사항
Rewriting techniques and applications : 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995 : proceedings / Jieh Hsiang, ed.
발행사항
Berlin ;   New York :   Springer,   1995.  
형태사항
xii, 471 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ;. 914.
ISBN
3540592008 (Berlin : acid-free paper) 0387592008 (New York : acid-free paper)
서지주기
Includes bibliographical references and index.
일반주제명
Rewriting systems (Computer science) --Congresses. Electronic digital computers --Programming --Congresses. Algorithms --Congresses.
000 01162camuuu200277 a 4500
001 000000922316
005 19990121094216.0
008 950314s1995 gw a b 101 0 eng
010 ▼a 95013007
020 ▼a 3540592008 (Berlin : acid-free paper)
020 ▼a 0387592008 (New York : acid-free paper)
040 ▼a DLC ▼c DLC ▼d DLC ▼d 244002
049 0 ▼l 151033035
050 0 0 ▼a QA267 ▼b .I555 1995
082 0 0 ▼a 005.13/1 ▼2 20
090 ▼a 004.1 ▼b L471 ▼c 914
111 2 ▼a International Conference on Rewriting Techniques and Applications ▼n (6th : ▼d 1995 : ▼c Kaiserslautern, Germany)
245 1 0 ▼a Rewriting techniques and applications : ▼b 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995 : proceedings / ▼c Jieh Hsiang, ed.
260 ▼a Berlin ; ▼a New York : ▼b Springer, ▼c 1995.
300 ▼a xii, 471 p. : ▼b ill. ; ▼c 24 cm.
440 0 ▼a Lecture notes in computer science ; ▼v . 914.
504 ▼a Includes bibliographical references and index.
650 0 ▼a Rewriting systems (Computer science) ▼x Congresses.
650 0 ▼a Electronic digital computers ▼x Programming ▼x Congresses.
650 0 ▼a Algorithms ▼x Congresses.
700 1 ▼a Hsiang, Jieh, ▼d 1954-.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 세종학술정보원/과학기술실/ 청구기호 004.1 L471 914 등록번호 151033035 도서상태 대출가능 반납예정일 예약 서비스 C

컨텐츠정보

목차

On some mathematical logic contributions to rewriting techniques: Lost heritage.- Modularity of completeness revisited.- Automatic termination proofs with transformation orderings.- A termination ordering for higher order rewrite systems.- A complete characterization of termination of 0p 1q?1r 0s.- On narrowing, refutation proofs and constraints.- Completion for multiple reduction orderings.- Towards an efficient construction of test sets for deciding ground reducibility.- Term rewriting in contemporary resolution theorem proving.- ??!?=1 Optimizing optimal ?-calculus implementations.- Substitution tree indexing.- Concurrent garbage collection for concurrent rewriting.- Lazy rewriting and eager machinery.- A rewrite mechanism for logic programs with negation.- Level-confluence of conditional rewrite systems with extra variables in right-hand sides.- A polynomial algorithm testing partial confluence of basic semi-Thue systems.- Problems in rewriting applied to categorical concepts by the example of a computational comonad.- Relating two categorical models of term rewriting.- Towards a domain theory for termination proofs.- Higher-order rewrite systems.- Infinitary lambda calculi and bohm models.- Proving the genericity lemma by leftmost reduction is simple.- (Head-)normalization of typeable rewrite systems.- Explicit substitutions with de bruijn's levels.- A restricted form of higher-order rewriting applied to an HDL semantics.- Rewrite systems for integer arithmetic.- General solution of systems of linear diophantine equations and inequations.- Combination of constraint solving techniques: An algebraic point of view.- Some independence results for equational unification.- Regular substitution sets: A means of controlling E-unification.- DISCOUNT: A system for distributed equational deduction.- ASTRE: Towards a fully automated program transformation system.- Parallel ReDuX ? PaReDuX.- STORM: A many-to-one associative-commutative matcher.- LEMMA: A system for automated synthesis of recursive programs in equational theories.- Generating polynomial orderings for termination proofs.- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2.- Prototyping completion with constraints using computational systems.- Guiding term reduction through a neural network: Some preliminary results for the group theory.- Studying quasigroup identities by rewriting techniques: Problems and first results.- Problems in rewriting III.


정보제공 : Aladin

관련분야 신착자료

김종원 (2020)
김자미 (2021)