Patrick Lebègue

According to our database1, Patrick Lebègue authored at least 14 papers between 1986 and 1996.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1996
Smallest Horn Clause Programs.
J. Log. Program., 1996

1994
One Binary Horn Clause is Enough.
Proceedings of the STACS 94, 1994

1993
Weighted Systems of Equations.
Theor. Comput. Sci., 1993

Halting Problem of One Binary Horn Clause is Undecidable.
Proceedings of the STACS 93, 1993

The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable.
Proceedings of the Logic Programming, 1993

1992
Weighted Systems Revisited.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.
Proceedings of the Logic Program Synthesis and Transformation, 1992

Termination induction by means of an abstract OLDT resolution.
Proceedings of the JFPL'92, 1992

Halting Problem of One Binary Horn Clause id Undecidable.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

1991
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs.
Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite.
Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Prolog Program Transformations and Meta-Interpreters.
Proceedings of the Logic Program Synthesis and Transformation, 1991

Abstract Interpretation and Recursive Behaviour of Logic Programs.
Proceedings of the Logic Program Synthesis and Transformation, 1991

1986
Weighted Graphs: A Tool for Logic Programming.
Proceedings of the CAAP '86, 1986


  Loading...