|
|
Conferences in DBLP
- Joseph A. Goguen
Proving and Rewriting. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:1-24 [Conf]
- Jordi Farrés-Casals
Proving Correctness wrt Specifications with Hidden Parts. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:25-39 [Conf]
- H. R. Walters
Hybrid Implementations of Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:40-54 [Conf]
- Françoise Debart, Patrice Enjalbert, Madeleine Lescot
Multi-Modal Logic Programming using Equational and Order-Sorted Logic. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:55-69 [Conf]
- Michael Hanus
Logic Programs with Equational Type Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:70-85 [Conf]
- Zhenyu Qian
Higher-Order Order-Sorted Algebras. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:86-100 [Conf]
- François Bronsard, Uday S. Reddy
Axiomatization of a Functional Logic Language. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:101-116 [Conf]
- Tien Huynh, Catherine Lassez, Jean-Louis Lassez
Fourier Algorithm Revisited. [Citation Graph (2, 0)][DBLP]
ALP, 1990, pp:117-131 [Conf]
- Aïda Batarekh
Fixpoint Techniques for Non-Monotone Maps. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:132-143 [Conf]
- Yuli Zhou, Robert Muller
Domain Theory for Nonmonotonic Functions. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:144-157 [Conf]
- Phan Minh Dung
On the strong completion of logic programs. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:158-172 [Conf]
- Taisuke Sato
An Equivalence Preserving First Order Unfold/fold Transformation System. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:173-188 [Conf]
- Helmut Simonis, Mehmet Dincbas
Propositional Calculus Problems in CHIP. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:189-203 [Conf]
- Maurizio Gabbrielli, Giorgio Levi
Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:204-216 [Conf]
- Kanchana Kanchanasut, Peter J. Stuckey
Eliminating Negation from Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:217-231 [Conf]
- Patrick Saint-Dizier
On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logic. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:232-246 [Conf]
- Jia Liang Han
Recursive Query Processing in Predicate-Goal Graph. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:247-261 [Conf]
- Pierre Lescanne
Implementations of Completion by Transition Rules + Control: ORME. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:262-269 [Conf]
- Françoise Bellegarde
A Matching Process Modulo a Theory of Categorical Products. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:270-282 [Conf]
- Nachum Dershowitz, Subrata Mitra, G. Sivakumar
Equation Solving in Conditional AC-Theories. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:283-297 [Conf]
- Juan José Moreno-Navarro, Herbert Kuchen, Rita Loogen, Mario Rodríguez-Artalejo
Lazy Narrowing in a Graph Machine. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:298-317 [Conf]
- Nachum Dershowitz, Naomi Lindenstrauss
An Abstract Concurrent Machine for Rewriting. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:318-331 [Conf]
- Reinhard Bündgen
Applying Term Rewriting Methods to Finite Groups. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:332-346 [Conf]
- Dieter Hofbauer
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:347-358 [Conf]
- Ke Li
Optimization of Rewriting and Complexity of Rewriting. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:359-371 [Conf]
- Joachim Steinbach
AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering. [Citation Graph (0, 0)][DBLP]
ALP, 1990, pp:372-386 [Conf]
|
