Search Results - "Rewriting systems (Computer science)"

Free operated monoids and rewriting systems.

Authors: Zhang, Jin Gao, Xing

Source: Semigroup Forum. Dec2018, Vol. 97 Issue 3, p435-456. 22p.

Rewriting Higher-Order Stack Trees.

Authors: Penelle, Vincent

Source: Theory of Computing Systems. Aug2017, Vol. 61 Issue 2, p536-580. 45p.

Subjects: Rewriting systems (Computer science), Machine theory, Graph theory, Transducers, Arbitrary constants

Derivational Complexity and Context-Sensitive Rewriting.

Authors: Lucas, Salvador¹ slucas@dsic.upv.es

Source: Journal of Automated Reasoning. Dec2021, Vol. 65 Issue 8, p1191-1229. 39p.

Subjects: Rewriting systems (Computer science), Programming languages, Polynomials, Computational complexity, Natural numbers

Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication.

Authors: Cohen, Shay B. Gildea, Daniel

Source: Computational Linguistics. Sep2016, Vol. 42 Issue 3, p421-455. 35p.

Subjects: Parsing (Computer grammar), Rewriting systems (Computer science), Speech perception, Boolean matrices, Matrix multiplications, Computational linguistics

Inducing production rules to extend existing design grammars: The parse/derive method.

Authors: Eichhoff, Julian R. Schmidt, Jens Roller, Dieter

Source: Computer-Aided Design & Applications. Jun2017, Vol. 14 Issue 4, p535-548. 14p.

Subjects: Space vehicle design & construction, Rewriting systems (Computer science), Computer-aided design, SysML (Computer science), Unified modeling language

THE LANGUAGE OF STRATIFIED SETS IS CONFLUENT AND STRONGLY NORMALISING.

Authors: GABBAY, MURDOCH J.¹

Source: Logical Methods in Computer Science (LMCS); 2018, Vol. 14 Issue 2, p1-34, 34p

Size-based termination of higher-order rewriting.

Authors: BLANQUI, FRÉDÉRIC¹ frederic.blanqui@inria.fr

Source: Journal of Functional Programming. 2018, Vol. 28, pN.PAG-N.PAG. 75p.

Inspecting Maude variants with GLINTS.

Authors: ALPUENTE, M. ESCOBAR, S. SAPI ÑA, J. et al.

Source: Theory & Practice of Logic Programming. Sep2017, Vol. 17 Issue 5/6, p689-707. 19p.

Opportunities and Challenges for Traceable Graph Rewriting Systems.

Authors: Seifert, Mirko¹ mirko.seifert@tu-dresden.de

Source: ICSE: International Conference on Software Engineering. 2008, p33-36. 4p.

Subjects: Rewriting systems (Computer science), Computer software development, Visual programming languages (Computer science), Machine theory, Visualization

Incremental Proofs of Operational Termination with Modular Conditional Dependency Pairs.

Authors: Nakamura, Masaki Ogata, Kazuhiro Futatsugi, Kokichi

Source: Proceedings of the International MultiConference of Engineers & Computer Scientists 2013. 2013, p1-6. 6p.

Subjects: Rewriting systems (Computer science), Machine theory, Mathematical logic, Control theory (Engineering), Artificial intelligence

Incremental Proofs of Operational Termination with Modular Conditional Dependency Pairs.

Authors: Masaki Nakamura Kazuhiro Ogata Kokichi Futatsugi

Source: International MultiConference of Engineers & Computer Scientists 2013. 2013, Vol. 1, p1-6. 6p.

Subjects: Rewriting systems (Computer science), Proof theory, Feature extraction, Programming languages, Object-oriented methods (Computer science), Computer software termination

On Describing Terminating Algebraic Specifications Based on Their Models.

Authors: Nakamura, Masaki Ogata, Kazuhiro Futatsugi, Kokichi

Source: Proceedings of the International MultiConference of Engineers & Computer Scientists 2012 Volume I. 2012, Vol. 1, p192-197. 6p.

Subjects: Rewriting systems (Computer science), Algebra, Machine theory, Technical specifications, Computer software termination

Parikh Matrices and Parikh Rewriting Systems.

Authors: Teh, Wen Chean¹ dasmenteh@usm.my

Source: Fundamenta Informaticae. 2016, Vol. 146 Issue 3, p305-320. 16p.

Subjects: Rewriting systems (Computer science), Injective functions, Complex multiplication, Monoids

Enhanced graph rewriting systems for complex software domains.

Authors: Eichler, Cédric Monteil, Thierry Stolf, Patricia et al.

Source: Software & Systems Modeling. Jul2016, Vol. 15 Issue 3, p685-705. 21p.

Subjects: Rewriting systems (Computer science), Computer software, Software architecture, Scalability, Requirements engineering

Hardware Synthesis of Recursive Functions through Partial Stream Rewriting.

Authors: Middendorf, Lars Bobda, Christophe Haubelt, Christian

Source: DAC: Annual ACM/IEEE Design Automation Conference; Jun2012, p1207-1215, 9p

MKBOOL: A Multi-Completion System for Boolean Constrained Reduction Orders.

Authors: Sato, Haruhiko Kurihara, Masahito

Source: International MultiConference of Engineers & Computer Scientists 2008; 2008, p354-359, 6p

QUERY REWRITING FOR OPEN XML DATA INTEGRATION SYSTEMS.

Authors: Boisson, Francois Scholl, Michel Sebei, Imen et al.

Source: Proceedings of the IADIS International Conference on WWW/Internet; Jan2006, p133-141, 9p, 5 Diagrams, 1 Graph

Paramodulation with Well-founded Orderings.

Authors: BOFILL, MIQUEL RUBIO, ALBERT

Source: Journal of Logic & Computation. Apr2009, Vol. 19 Issue 2, p263-302. 40p.

Subjects: Rewriting systems (Computer science), Equations, Proof theory, Monotonic functions, Completeness theorem, Mathematical logic

Interaction Net Implementation of Additive and Multiplicative Structures.

Authors: Mackie, Ian¹ ian@dcs.kcl.ac.uk

Source: Journal of Logic & Computation. Apr2005, Vol. 15 Issue 2, p219-237. 19p.

Subjects: Rewriting systems (Computer science), Calculus, Coding theory, Encoding, Programming languages, Evaluators

Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting.

Authors: Sinot, François-Régis¹ frs@lix.polytechnique.fr

Source: Journal of Logic & Computation. Apr2005, Vol. 15 Issue 2, p201-218. 18p.

Subjects: Computational linguistics, Rewriting systems (Computer science), Mathematical variables, Calculus, Computer science, Information theory