(Enter summary)
Abstract: This paper shows that the annotation proof method, proposed by Deransart
for proving declarative properties of logic programs, is also applicable for
proving correctness of directional types. In particular, the sufficient correctness
criterion of well-typedness by Bronsard et al, turns out to be a
specialization of the annotation method. The comparison shows a general
mechanism for construction of similar specializations, which is applied to
derive yet another concept of well-typedness. The... (Update)
Similar documents based on text: More All
0.3: Under consideration for publication in Theory and Practice of.. - Errors In Clp
(Correct)
0.1: Using parametric set constraints for locating errors.. - Drabent, MALUSZYNSKI, ..
(Correct)
0.1: Directional Types for Logic Programs and the Annotation Method - Boye, Maluszynski (1995)
(Correct)
BibTeX entry: (Update)
J. Boye and J. Ma/luszy'nski. Directional types and the annotation method. Journal of Logic Programming, 33:179--220, 1997. http://citeseer.ist.psu.edu/boye97directional.html More
@article{ boye97directional,
author = "Johan Boye and Jan Maluszynski",
title = "Directional Types and the Annotation Method",
journal = "Journal of Logic Programming",
volume = "33",
number = "3",
pages = "179-220",
year = "1997",
url = "citeseer.ist.psu.edu/boye97directional.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
440
The Art of Prolog (context) - Sterling, Shapiro - 1986
121
Concurrent Constraint Programming Languages (context) - Saraswat - 1990
78
Predicate logic as a computational formalism (context) - Clark - 1979
70
A grammatical view on logic programming (context) - Deransart, Ma - 1993
67
Reasoning about Prolog programs: from modes through types to..
- Apt, Marchiori - 1994
55
A framework of directionality for proving termination of log.. (context) - Bronsard, Lakshman et al.
54
SICStus Prolog user's manual (context) - Carlsson, Wid'en et al.
52
Towards a meaning of LIFE (context) - Ait-Kaci, Podelski - 1993
48
the unification-free Prolog programs
- Apt, Etalle - 1993
42
Verifying correctness of logic programs (context) - Bossi, Cocco - 1989
42
Termination proofs for logic programs (context) - Plumer - 1990
41
an efficient purely declarative logic programming language (context) - Somogyi, Henderson et al. - 1996
31
Directional type checking of logic programs
- Aiken, Lakshman - 1994
31
Declarative programming in Prolog
- Apt - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ida.liu.se.html): More
User Interface Design Support Tools and Critiquing - Ericsson (1994)
(Correct)
Specification and Synthesis of Plans Using the Features and.. - Karlsson (1995)
(Correct)
Computing Circumscription Revisited: Preliminary Report - Doherty, Lukaszewicz, Szalas (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC