Add to ORKGAbstract. We explore in this paper the use of efficient data structures to implement operations on first-order terms, that can be formally verified. Specifically, we present the status of our work on defining and verifying a unification algorithm acting on terms represented as directed acyclic graphs (dags). This implementation is done using single threaded objects (stobjs) to store a dag representing the unification problem
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the shari...
If we represent a λ-calculus term as a DAG rather than a tree, we can efficiently represent the shar...
Generic algorithms are algorithms using abstract data types. Multiple generic algorithms can be link...
We describe in this paper the formal verification, using the ACL2 system, of a syntactic unificatio...
Term unification plays an important role in many areas of computer science, especially in those rela...
AbstractThe problem of unification of terms is log-space complete for P. In deriving this lower boun...
In all applications of term rewriting systems, computing the normal forms of terms is the fundament...
D The problem of unification of terms is log-space complete for P. In deriving this lower bound no u...
AbstractWe propose a path-based framework for deriving and simplifying source-tracking information f...
One-context unification is an extension of first-order term unification in which a variable of arity...
A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitu...
First-order term unification is an essential concept in areas like functional and logic programming,...
Abstract: The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed ...
Abstract. The graph programming language GP allows to apply sets of rule schemata (or “attributed ” ...
AbstractConventional logic-programming languages rely fundamentally on symbolic computation with qua...
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the shari...
If we represent a λ-calculus term as a DAG rather than a tree, we can efficiently represent the shar...
Generic algorithms are algorithms using abstract data types. Multiple generic algorithms can be link...
We describe in this paper the formal verification, using the ACL2 system, of a syntactic unificatio...
Term unification plays an important role in many areas of computer science, especially in those rela...
AbstractThe problem of unification of terms is log-space complete for P. In deriving this lower boun...
In all applications of term rewriting systems, computing the normal forms of terms is the fundament...
D The problem of unification of terms is log-space complete for P. In deriving this lower bound no u...
AbstractWe propose a path-based framework for deriving and simplifying source-tracking information f...
One-context unification is an extension of first-order term unification in which a variable of arity...
A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitu...
First-order term unification is an essential concept in areas like functional and logic programming,...
Abstract: The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed ...
Abstract. The graph programming language GP allows to apply sets of rule schemata (or “attributed ” ...
AbstractConventional logic-programming languages rely fundamentally on symbolic computation with qua...
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the shari...
If we represent a λ-calculus term as a DAG rather than a tree, we can efficiently represent the shar...
Generic algorithms are algorithms using abstract data types. Multiple generic algorithms can be link...