Pierre Deransart - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2004

Main Results of the OADymPPaC ProjectPierre Deransart. ICLP 2004: 456-457 [doi]

2003

2002

Subject Reduction of Logic Programs as Proof-Theoretic PropertyPierre Deransart, Jan-Georg Smaus. jflp, 2002, 2002. [doi]

Prototypage de traceurs CLP(FD): un modèle de trace et son expérimentationLudovic Langevine, Pierre Deransart, Mireille Ducassé, Erwan Jahier. jfplc 2002: 135

2001

2000

Towards a Language for CLP Choice-Tree VisualisationChristophe Aillaud, Pierre Deransart. discipl 2000: 209-236

Les programmes bien typés ont tout bonPierre Deransart, Jan-Georg Smaus. jfplc 2000: 49-66

IntroductionPierre Deransart, Manuel V. Hermenegildo, Jan Maluszynski. discipl 2000: 1-20

Using Modes to Ensure Subject Reduction for Typed Logic Programs with SubtypingJan-Georg Smaus, François Fages, Pierre Deransart. fsttcs 2000: 214-226 [doi]

1999

Vers un arbre de spécification d arbres de choix en PLCChristophe Aillaud, Pierre Deransart. jfplc 1999: 249-264

1997

On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic ProgramsFrancisco Bueno, Pierre Deransart, Wlodzimierz Drabent, Gérard Ferrand, Manuel V. Hermenegildo, Jan Maluszynski, Germán Puebla. AADEBUG 1997: 155-169 [doi]

1996

Une méthode de preuve pour programmes concurrents avec contraintes sous forme clausalePascal Chambre, Pierre Deransart, Jan Maluszynski. jfplc 1996: 115-130

Prolog - the standard: reference manualPierre Deransart, AbdelAli Ed-Dbali, Laurent Cervoni. Springer, 1996.

A Hypertext Based Environment to Write Literate Logic Programs (Poster Abstract)Pierre Deransart, Patrick Parot, Roberto da Silva Bigonha, José de Siqueira. ICLP 1996: 540

1995

Task Force on Logic Program Development (Compulog Project)Pierre Deransart, Henryk Jan Komorowski. lpe 1995:

1994

Towards a Proof method of Non-Suspension of Concurrent Constraint Logic ProgramsPascal Chambre, Pierre Deransart. ICLP 1994:

Design of Redundant Formal Specifications by Logic Programming: Merging Formal Text and Good CommentsSophie Renault, Pierre Deransart. ijseke, 4(3):369-390, 1994. [doi]

A Proof Manager for Verification of Logic ProgramsSophie Renault, Pierre Deransart. ICLP 1994:

Design of Redundant Formal Specifications by Logic programming: Merging Formal Text and Good CommentsSophie Renault, Pierre Deransart. ICLP 1994:

1993

Proof Methods of Declarative Properties of Definite ProgramsPierre Deransart. TCS, 118(2):99-166, 1993.

A grammatical view of logic programmingPierre Deransart, Jan Maluszynski. MIT Press, 1993.

Proof Method of Partial Correctness and Weak Completeness for Normal Logic ProgramsGérard Ferrand, Pierre Deransart. jlp, 17(2/3&4):265-278, 1993.

1992

An Operational Formal Definition of PROLOG: A Specification Method and Its ApplicationPierre Deransart, Gérard Ferrand. ngc, 10(2):121-172, 1992.

Software Formal Specification by Logic Programming: The Example of Standard PrologAbdelAli Ed-Dbali, Pierre Deransart. lpss 1992: 278-289

Proof Method of Partial Correctness and Weak Completeness for Normal Logic ProgramsGérard Ferrand, Pierre Deransart. ICLP 1992: 161-174

1991

NSTO Programs (Not Subject to Occur-Check)Pierre Deransart, Gérard Ferrand, Michel Téguia. SLP 1991: 533-547

Software Development and Logic ProgrammingYves Deville, Leon Sterling, Pierre Deransart. ICLP 1991: 941

1989

Proofs of Declarative Properties of Logic ProgramsPierre Deransart. tapsoft 1989: 207-226

Test d occurence en PROLOG et grammaires attribuéesPierre Deransart, Gérard Ferrand, Michel Téguia. jfplc 1989: 113-142

Une vue méthodologique de la Programmation en Logique avec négationPierre Deransart, Gérard Ferrand. jfplc 1989: 403

Sur la multiplicité des Sémantiques Opérationnelles de la Programmation en Logique, leur Modélisation à l aide de Grammaires Attribuées et leur utilisation pour valider des Programmes LogiquesPierre Deransart. jfplc 1989: 41

1988

Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic ProgrammingBruno Courcelle, Pierre Deransart. iandc, 78(1):1-55, July 1988.

Attribute Grammars: Definitions, Systems, and BibliographyPierre Deransart, Martin Jourdan, Bernard Lorho. Volume 323 of Lecture Notes in Computer Science, Springer, 1988.

A Grammatical View of Logic ProgrammingPierre Deransart, Jan Maluszynski. plilp 1989: 219-251

1987

Spécification formelle de Prolog standardPierre Deransart, C. Moss, G. Richard. jfplc 1987: 455

An Operational Formal Definition of PROLOGPierre Deransart, Gérard Ferrand. SLP 1987: 162-172

Preuves de correction partielle des programmes logiquesPierre Deransart. jfplc 1987: 29

1986

Programmation en logique: méthodologie et enseignementPierre Deransart, Gérard Ferrand. jfplc 1986: 75-90

1985

Détection d erreurs en programmation en logiquePierre Deransart, Gérard Ferrand. jfplc 1985:

Relating Logic Programs and Attribute GrammarsPierre Deransart, Jan Maluszynski. jlp, 2(2):119-155, 1985.

1984

Speeding up Circularity Tests for Attribute GrammarsPierre Deransart, Martin Jourdan, Bernard Lorho. ACTA, 21:375-391, 1984.

Modélisation du flot de données par des schémas d attributs dans les programmes logiquesPierre Deransart, Jan Maluszynski. jfplc 1984:

1983

Logical Attribute GrammarsPierre Deransart. ifip 1983: 463-469

Une sémantique opérationnelle algébrique de programmes PROLOGPierre Deransart. jfplc 1983:

An Operational Algebraic Semantics of Prolog ProgramsPierre Deransart. ICLP 1983: 437-442 [doi]

1982

Prolog et types abstraits algébriquesPierre Deransart. jfplc 1982:

1981

Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in PrologMarc Bergman, Pierre Deransart. caap 1981: 101-116

1979

Proof by Semantic Attributes of a LISP CompilerPierre Deransart. cj, 22(3):240-245, 1979.

The language LISP does not exist?Pierre Deransart. SIGPLAN, 14(5):24-27, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL