Travelled to:1 × Denmark
1 × France
4 × USA
Collaborated with:P.Deransart A.Lallouet B.Malfon ∅ M.Téguia
Talks about:program (6) logic (4) correct (3) partial (2) prolog (2) normal (2) method (2) domain (2) proof (2) character (1)
Person: Gérard Ferrand
DBLP: Ferrand:G=eacute=rard
Contributed to:
200219951992199119911987Wrote 7 papers:
- ICLP-2002-FerrandL #approximate #finite #logic programming #reduction
- A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs (GF, AL), pp. 478–479.
- ILPS-1995-FerrandL #composition #correctness #logic programming #proving #source code
- A Compositional Proof Method of Partial Correctness for Normal Logic Programs (GF, AL), pp. 209–223.
- ILPS-1995-MalfonF #approach #semantics #source code
- Type Correct programs: A semantic approach (BM, GF), pp. 576–590.
- JICSLP-1992-FerrandD #correctness #logic programming #proving #source code
- Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs (GF, PD), pp. 161–174.
- ICLP-1991-Ferrand #concept #logic programming #prolog
- Basic Concepts of Logic Programming and Prolog (GF), p. 942.
- ISLP-1991-DeransartFT #source code
- NSTO Programs (Not Subject to Occur-Check) (PD, GF, MT), pp. 533–547.
- SLP-1987-DeransartF87 #prolog
- An Operational Formal Definition of PROLOG (PD, GF), pp. 162–172.