|
СТ |
A Relational Semantics for Logic Programming |
1988 |
Raatz S., Gallier J. |
|
|
|
Logic Programming: Proc./Fifth Intern.Conf. and Symp. |
13.10.1994 |
|
СТ |
Constructive Logics Part I: A Tutorial on Proof Systems and Typed -Calculi |
1993 |
Gallier J. |
|
|
|
Theoretical Computer Science |
07.04.1993 |
|
СТ |
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time |
1993 |
Gallier J., Narendran P., Plaisted D., Raatz S., Snyder W. |
|
|
|
J. of the ACM |
04.03.1993 |
|
СТ |
Theorem Proving Using Equational Matings and Regid E-Unification |
1992 |
Gallier J., Narendran P., Raatz S., Snyder W. |
|
|
|
J. of the ACM |
29.05.1992 |
|
П |
Constructive Logics. Part II: Linear Logic and Proof Nets |
1991 |
Gallier J. |
|
|
Digital |
|
09.05.1992 |
|
П |
Constructive Logics. Part I: A tutorial on Proof Systems and Typed -Calculi |
1991 |
Gallier J. |
|
|
Digital |
|
09.05.1992 |
|
СТ |
Polymorphic rewriting conserves algebraic strong normalization |
1991 |
Breazu-Tannen V., Gallier J. |
|
|
|
Theoretical Computer Science |
10.09.1991 |
