Form and Content in Computer Science (1970 ACM turing lecture)
Journal of the ACM (JACM)
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Translating recursion equations into flow charts
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Feedback vertex sets and cyclically reducible graphs
Journal of the ACM (JACM)
Program transformations in a denotational setting
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Journal of Symbolic Computation
M-LISP: its natural semantics and equational logic
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
M-LISP: a representation-independent dialect of LISP with reduction semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of using history for equational systems with applications
Journal of the ACM (JACM)
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Combining constructive and equational geometric constraint-solving techniques
ACM Transactions on Graphics (TOG)
Testing for the Church-Rosser Property
Journal of the ACM (JACM)
A Completeness Theorem for Straight-Line Programs with Structured Variables
Journal of the ACM (JACM)
Minimal and Optimal Computations of Recursive Programs
Journal of the ACM (JACM)
Data Flow Analysis for Procedural Languages
Journal of the ACM (JACM)
Constructing Call-by-Value Continuation Semantics
Journal of the ACM (JACM)
Operational and Semantic Equivalence Between Recursive Programs
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Procedure linkage optimization working paper
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Applications of a graph grammar for program control flow analysis
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Minimal and optimal computations of recursive programs
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An interpreter generator using tree pattern matching
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Journal of Automated Reasoning
On the Security of Ping-Pong Protocols when Implemented using the RSA
CRYPTO '85 Advances in Cryptology
Tree Replacement and Public Key Cryptosystem
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A framework for studying substitution
Acta Cybernetica
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Highlights of the history of the lambda-calculus
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Unique normal forms in term rewriting systems with repeated variables
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The recognition of Series Parallel digraphs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
A Church-Rosser theorem for graph grammars
ACM SIGACT News
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
A contraction algorithm for finding minimal feedback sets
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Attacking a public key cryptosystem based on tree replacement
Discrete Applied Mathematics
Shallow confluence of conditional term rewriting systems
Journal of Symbolic Computation
Proving Confluence of Term Rewriting Systems Automatically
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Diagrammatic Confluence and Completion
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Unique normal forms and confluence of rewrite systems: persistence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A correct rule-based geometric constraint solver
Computers and Graphics
Program equivalence and context-free grammars
Journal of Computer and System Sciences
Correct and optimal implementations of recursion in a simple programming language
Journal of Computer and System Sciences
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters
Learning of church-Rosser tree rewriting systems
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
Electronic Notes in Theoretical Computer Science (ENTCS)
Decreasing Diagrams and Relative Termination
Journal of Automated Reasoning
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
RTA'05 Proceedings of the 16th 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
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
Decreasing diagrams and relative termination
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A lambda-calculus model of programming languages-II. Jumps and procedures
Computer Languages
On Explicit Substitution with Names
Journal of Automated Reasoning
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
From diagrammatic confluence to modularity
Theoretical Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Hi-index | 0.01 |
Subtree replacement systems form a broad class of tree-manipulating systems. Systems with the “Church-Rosser property” are appropriate for evaluation or translation processes: the end result of a complete sequence of applications of the rules does not depend on the order in which the rules were applied. Theoretical and practical advantages of such flexibility are sketched. Values or meanings for trees can be defined by simple mathematical systems and then computed by the cheapest available algorithm, however intricate that algorithm may be.We derive sufficient conditions for the Church-Rosser property and discuss their applications to recursive definitions, to the lambda calculus, and to parallel programming. Only the first application is treated in detail. We extend McCarthy's recursive calculus by allowing a choice between call-by-value and call-by-name. We show that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm. We also show that these functions solve their defining equations in a “canonical” manner.