Journal of Symbolic Computation - Special issue on automatic programming
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simulating the Behavior of Software Modules by Trace Rewriting
IEEE Transactions on Software Engineering
A fine-grained parallel completion procedure
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Simulating the behaviour of software modules by trace rewriting
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PolyP—a polytypic programming language extension
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Toward a complete transformational toolkit for compilers
ACM Transactions on Programming Languages and Systems (TOPLAS)
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing term rewriting using discrimination nets with specialization
Proceedings of the 1999 ACM symposium on Applied computing
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Light analysis of complex systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Journal of the ACM (JACM)
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
A Polymorphic Environment Calculus and its Type-Inference Algorithm
Higher-Order and Symbolic Computation
A slicing-based approach for locating type errors
ACM Transactions on Software Engineering and Methodology (TOSEM)
Functional and constraint logic programming
Constraints in computational logics
On the longest perpetual reductions in orthogonal expression reduction systems
Theoretical Computer Science
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Information and Computation
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
The narrowing-driven approach to functional logic program specialization
New Generation Computing - Partial evaluation and program transformation
Formal Proofs About Rewriting Using ACL2
Annals of Mathematics and Artificial Intelligence
Completion for Multiple Reduction Orderings
Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference
Journal of Automated Reasoning
Contexts in Dynamic Predicate Logic
Journal of Logic, Language and Information
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
Journal of Logic, Language and Information
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Journal of Logic, Language and Information
An Operational Approach to the Semantics of Classes: Application to Type Checking
Programming and Computing Software
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
Conservation and uniform normalization in Lambda calculi with erasing reductions
Information and Computation
Context-sensitive rewriting strategies
Information and Computation
Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
High-level modeling and FPGA prototyping of microprocessors
FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Using Term Rewriting to Verify Software
IEEE Transactions on Software Engineering
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Normalization, approximation, and semantics for combinator systems
Theoretical Computer Science
Fatal steps of Knuth-Bendix completion
Nordic Journal of Computing
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Binary Decision Diagrams by Shard Rewriting
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Complete Selection Function for Lazy Conditional Narrowing
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
From Graph Transformation to Rule-Based Programming with Diagrams
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Type Inference with Recursive Type Equations
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On the Modularity of Deciding Call-by-Need
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Jakarta: A Toolset for Reasoning about JavaCard
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
Context-Sensitive AC-Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Abstraction and Control for Shapely Nested Graph Transformation
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Bijections between Partitions by Two-Directional Rewriting Techniques
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Formalizing Rewriting in the ACL2 Theorem Prover
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
On testing of classes in object-oriented programs
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Simply Observable Behavioral Specification
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Completing Partial Combinatory Algebras with Unique Head-Normal Forms
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Conditional narrowing without conditions
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Constraint contextual rewriting
Journal of Symbolic Computation - Special issue: First order theorem proving
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
Context-exploiting shapes for diagram transformation
Machine Graphics & Vision International Journal - Special issue on diagrammatics & Design
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Extending partial combinatory algebras
Mathematical Structures in Computer Science
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
The algebraic structure of interfaces
Science of Computer Programming
Parallelizing functional programs by generalization
Journal of Functional Programming
Computational types from a logical perspective
Journal of Functional Programming
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Leftmost outside-in narrowing calculi
Journal of Functional Programming
A psycholinguistically motivated parser for CCG
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Abstraction and control for shapely nested graph transformation
Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
Nordic Journal of Computing
Formalization and abstract implementation of rewriting with nested rules
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Strong normalisation in the π-calculus
Information and Computation
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
Theoretical Computer Science
Decidable call-by-need computations in term rewriting
Information and Computation
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Towards lightweight checks for mass maintenance transformations
Science of Computer Programming
Translation of Algebraic Programs into Executable Codes
Cybernetics and Systems Analysis
Remarks on the equational theory of non-normalizing pure type systems
Journal of Functional Programming
A structural approach to reversible computation
Theoretical Computer Science
The conflict-free reduction geometry
Theoretical Computer Science
On modularity in infinitary term rewriting
Information and Computation
LARS: A learning algorithm for rewriting systems
Machine Learning
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
The rational numbers as an abstract data type
Journal of the ACM (JACM)
Two Problems on Reduction Graphs in Lambda Calculus
Fundamenta Informaticae
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Removing redundant arguments automatically
Theory and Practice of Logic Programming
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Structure and Properties of Traces for Functional Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy Context Cloning for Non-Deterministic Graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A slicing-based approach for locating type errors
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Monitoring conversational web services
2nd international workshop on Service oriented software engineering: in conjunction with the 6th ESEC/FSE joint meeting
IEEE Transactions on Computers
Termination of just/fair computations in term rewriting
Information and Computation
Developing and debugging algebraic specifications for Java classes
ACM Transactions on Software Engineering and Methodology (TOSEM)
A Note on Rewriting Proofs and Fibonacci Numbers
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Semantic Verification of Web System Contents
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
Generating priority rewrite systems for OSOS process languages
Information and Computation
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity of Fractran and Productivity
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Equational reasoning using AC constraints
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Strong normalization property for second order linear logic
Theoretical Computer Science
A fold/unfold transformation framework for rewrite theories extended to CCT
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Decidable call-by-need computations in term rewriting
Information and Computation
On modularity in infinitary term rewriting
Information and Computation
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
A normalisation result for higher-order calculi with explicit substitutions
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Polarized process algebra and program equivalence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Abstract diagnosis of functional programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Correction of functional logic programs
ESOP'03 Proceedings of the 12th European conference on Programming
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Degrees of undecidability in term rewriting
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Converting between combinatory reduction systems and big step semantics
Semantics and algebraic specification
Levels of undecidability in rewriting
Information and Computation
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
Journal of Automated Reasoning
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Completeness of global evaluation logic
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Graph transformation with variables
Formal Methods in Software and Systems Modeling
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On the correctness of bubbling
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Skew and ω-skew confluence and abstract Böhm semantics
Processes, Terms and Cycles
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Least upper bounds on the size of church-rosser diagrams in term rewriting and λ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Obtaining a COBOL grammar from legacy code for reengineering purposes
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
A case study of a slicing-based approach for locating type errors
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Backward trace slicing for conditional rewrite theories
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Explicit Substitution with Names
Journal of Automated Reasoning
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Abstraction and Control for Shapely Nested Graph Transformation
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
Two Problems on Reduction Graphs in Lambda Calculus
Fundamenta Informaticae
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Formalising Abilities and Opportunities of Agents
Fundamenta Informaticae
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
CARTESIAN STREAM TRANSFORMER COMPOSITION
Fundamenta Informaticae
RANK 2 INTERSECTION TYPE ASSIGNMENT IN TERM REWRITING SYSTEMS
Fundamenta Informaticae
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
An incremental learning algorithm for extended mealy automata
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
ACM Transactions on Computational Logic (TOCL)
Closed type families with overlapping equations
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
Fundamenta Informaticae
| Hi-index | 0.01 |