(Enter summary)
Abstract: We present an algorithm for automatic type checking of logic programs with respect to directional
types that describe both the structure of terms and the directionality of predicates. The type checking
problem is reduced to a decidable problem on systems of inclusion constraints over set expressions.
We discuss some properties of the reduction algorithm, complexity, and present a proof of correctness.
1
1 Introduction
Most logic programming languages are untyped. In Prolog, for example,... (Update)
Context of citations to this paper: More
...automated reasoning about Herbrand set constraints. These include analyses of programming languages [4, 17, 1 31] logic programming [2, 18] and the study of finite automata [8] On the theoretical side, rapid progress has been made in understanding the algorithms for and...
.... the dependencies between the types of the terms that can be bound to a program s variables and generalizes the notion of directional types [1, 7]. The analysis is performed in two stages. First, a given program P is abstracted to a corresponding set logic program P in which...
Cited by: More
Domain Construction for Mode Analysis of - Typed Logic Programs (1997)
(Correct)
Set-based Error Diagnosis of Concurrent Constraint Programs - Podelski, Charatonik, Müller (1997)
(Correct)
Polymorphic Directional Types for Logic Programming - Rychlikowski, Truderung (2001)
(Correct)
Active bibliography (related documents): More All
0.5: Mode and Termination Checking for Higher-Order Logic.. - Ekkehard Rohwedder.. (1996)
(Correct)
0.3: Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003)
(Correct)
0.3: Independence of the Computation Rule for.. - Bergère.. (1993)
(Correct)
Similar documents based on text: More All
0.2: Data Sharing Analysis for Titanium - Liblit, al. (2001)
(Correct)
0.2: Directional Type Inference for Logic Programs - Charatonik, Podelski (1998)
(Correct)
0.1: Discriminative Direction for Kernel Classifiers - Golland (2001)
(Correct)
Related documents from co-citation: More All
18: A framework of directionality for proving termination of logic programs (context) - Bronsard, Lakshman et al. - 1992
12: Integrating modes and subtypes into a Prolog typechecker (context) - Rouzaud, Nguyen-Phuong - 1992
11: Towards a theory of types in Prolog (context) - Mishra - 1984
BibTeX entry: (Update)
A. Aiken and T. K. Lakshman. Directional type checking of logic programs. In SAS '94, pages 43--60. Springer-Verlag, 1994. http://citeseer.ist.psu.edu/aiken94directional.html More
@inproceedings{ alexander94directional,
author = "Aiken, Alexander and Lakshman, T.K.",
title = "Directional Type Checking of Logic Programs",
booktitle = "Proceedings of the First International Static Analysis Symposium",
publisher = "Springer Verlag",
editor = "Le~Charlier, Baudoin",
pages = "43--60",
year = "1994",
url = "citeseer.ist.psu.edu/aiken94directional.html" }
Citations (may not include all citations):
247
The family of concurrent logic programming languages (context) - Shapiro - 1989
111
Solving systems of set constraints (context) - Aiken, Wimmers - 1992
94
A Finite Presentation Theorem for approximating logic progra..
- Heintze, Jaffar - 1990
91
Towards a theory of types in PROLOG (context) - Mishra - 1984
89
Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
82
A decision procedure for a class of set constraints
- Heintze, Jaffar - 1990
79
Static inference of modes and data dependencies in logic pro..
- Debray - 1989
76
Set constraints are the monadic class
- Bachmair, Ganzinger et al. - 1993
66
Declaration-free type checking (context) - Mishra, Reddy - 1985
63
Parallel Logic Programming in PARLOG (context) - Gregory - 1987
56
Lower bounds for natural proof systems (context) - Kozen - 1977
55
A framework of directionality for proving termination of log.. (context) - Bronsard, Lakshman et al. - 1992
52
Decidability of systems of set constraints with negative con..
- Aiken, Kozen et al. - 1993
50
Solving Systems of Set Constraints with Negated Subset Relat.. (context) - Gilleron, Tison et al. - 1993
48
the Unification-free Prolog Programs
- Apt, Etalle - 1993
34
A Regular Type Language for Logic Programs (context) - Dart, Zobel - 1992
33
Deciding equivalence of finite tree automata (context) - Seidl - 1990
31
Declarative Programming in Prolog
- Apt - 1993
31
Polymorphically Typed Logic Programs
- Yardeni, Fruhwirth et al. - 1992
24
Integrating Modes and Subtypes into a Prolog TypeChecker (context) - Rouzaud, Nguyen-Phoung - 1992
20
Lecture Notes in Computer Science (context) - Naish, control - 1986
20
Logic programs as types for logic programs (context) - Fruwirth, Shapiro et al. - 1991
3
Moded Type Systems to Support Abstraction (context) - Zachary, Yelick - 1992
2
A Pragmatic View of Types for Logic Programs (context) - Jacobs - 1992
1
chapter in Types in Logic Programming (context) - Heintze, Jaffar et al. - 1992
1
Directionally Typed Prolog: Unifying notions of Types and Di.. (context) - Bronsard, Lakshman et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~aiken/publications/publications.html): More
The Complexity of Set Constraints - Aiken, Kozen, Vardi, Wimmers (1993)
(Correct)
Better Static Memory Management: Improving Region-Based.. - Aiken, al. (1995)
(Correct)
Static Type Inference in a Dynamically Typed Language - Aiken, Murphy (1991)
(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