Hubert Comon-Lundh

Inductive Proofs by Specification Transformation

Hubert Comon-Lundh, 1989, RTA.

Computational and Symbolic Anonymity in an Unbounded Network

Hideki Sakurada, Hubert Comon-Lundh, Yusuke Kawamoto, 2009, JSIAM Lett..

Sufficient Completness, Term Rewriting Systems and "Anti-Unification"

Hubert Comon-Lundh, 1986, CADE.

About Proofs by Consistency (Abstract)

Hubert Comon-Lundh, 1998, RTA.

An Effective Method for Handling Initial Algebras

Hubert Comon-Lundh, Hubert Comon-Lundh, 1988, International Conference on Algebraic and Logic Programming.

Complete Axiomatizations of Some Quotient Term Algebras

Hubert Comon-Lundh, 1991, ICALP.

Constraints in Term Algebras: An Overview of Constraint Solving Techniques

Hubert Comon-Lundh, 1994, Constraint Programming.

Sequentiality, Second Order Monadic Logic and Tree Automata

Hubert Comon-Lundh, 1995, LICS.