Conditional and Typed Rewriting Systems : 4th International Workshop, CTRS-94 Jerusalem, Israel, July 13-15, 1994 Proceedings / edited by Nachum Dershowitz, Naomi Lindenstrauss.

Contributor(s): Dershowitz, Nachum | Lindenstrauss, Naomi
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 968.Publisher: Berlin, Heidelberg : Springer-Verlag, 1995Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540455134; 3540455132; 3540603816; 9783540603818Subject(s): Computer science | Logic design | Artificial intelligence | Algebra | Mathematics | Physical Sciences & Mathematics | Mathematical Logic and Formal Languages | Theory of Computation | Software Engineering/Programming and Operating Systems | Programming Languages, Compilers, Interpreters | Artificial Intelligence | Logics and Meanings of Programs | Artificial intelligence | Computer science | Logic designGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
Contents:
Associative-commutative superposition -- A calculus for rippling -- Equation solving in geometrical theories -- LSE narrowing for decreasing conditional term rewrite systems -- Preserving confluence for rewrite systems with built-in operations -- Hierarchical termination -- Well-foundedness of term orderings -- A new characterisation of AC-termination and application -- Relative normalization in orthogonal expression reduction systems -- On termination and confluence of conditional rewrite systems -- How to transform canonical decreasing CTRSs into equivalent canonical TRSs -- Termination for restricted derivations and conditional rewrite systems -- Rewriting for preorder relations -- Strong sequentiality of left-linear overlapping rewrite systems -- A conflict between call-by-need computation and parallelism -- The complexity of testing ground reducibility for linear word rewriting systems with variables -- Coherence for cartesian closed categories: A sequential approach -- Modular properties of constructor-sharing conditional term rewriting systems -- Church-Rosser property and unique normal form property of non-duplicating term rewriting systems -- The transformation of term rewriting systems based on well-formedness preserving mappings -- Abstract notions and inference systems for proofs by mathematical induction.
Summary: This book presents throroughly revised full versions of the 21 papers accepted for the Fourth International Workshop on Conditional and Typed Rewriting Systems, CTRS-94, held in conjunction with ICALP '94 in Jerusalem, Israel, in July 1994. The volume reports the research advances in the area of rewriting in general achieved since the predecessor workshop held in July 1992. Among the topics addressed are conditional term rewriting, typed systems, higher-order rewriting, graph rewriting, combinator-based languages, and constrained rewriting.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

This book presents throroughly revised full versions of the 21 papers accepted for the Fourth International Workshop on Conditional and Typed Rewriting Systems, CTRS-94, held in conjunction with ICALP '94 in Jerusalem, Israel, in July 1994. The volume reports the research advances in the area of rewriting in general achieved since the predecessor workshop held in July 1992. Among the topics addressed are conditional term rewriting, typed systems, higher-order rewriting, graph rewriting, combinator-based languages, and constrained rewriting.

Associative-commutative superposition -- A calculus for rippling -- Equation solving in geometrical theories -- LSE narrowing for decreasing conditional term rewrite systems -- Preserving confluence for rewrite systems with built-in operations -- Hierarchical termination -- Well-foundedness of term orderings -- A new characterisation of AC-termination and application -- Relative normalization in orthogonal expression reduction systems -- On termination and confluence of conditional rewrite systems -- How to transform canonical decreasing CTRSs into equivalent canonical TRSs -- Termination for restricted derivations and conditional rewrite systems -- Rewriting for preorder relations -- Strong sequentiality of left-linear overlapping rewrite systems -- A conflict between call-by-need computation and parallelism -- The complexity of testing ground reducibility for linear word rewriting systems with variables -- Coherence for cartesian closed categories: A sequential approach -- Modular properties of constructor-sharing conditional term rewriting systems -- Church-Rosser property and unique normal form property of non-duplicating term rewriting systems -- The transformation of term rewriting systems based on well-formedness preserving mappings -- Abstract notions and inference systems for proofs by mathematical induction.

Includes bibliographical references and index.

There are no comments for this item.

to post a comment.

Powered by Koha