See this document in CiteSeerX!

A Generic Type System for CLP(X)  (Make Corrections)  
François Fages, Massimo Paltrinieri



  Home/Search   Context   Related

 
View or download:
ens.fr/~fages/Papers/iclp98FP.ps.gz
dmi.ens.fr/~fages/Pape...iclp98FP.ps.gz
dmi.ens.fr/ftp/pub...iens9716.A4.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ens.fr/~fages/papers (more)
From:  dmi.ens.fr/EDITIO...liens.langlog
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We propose a generic static type system for Constraint Logic Programming including subtyping and parametric polymorphism. The first aim of this prescriptive type system is to detect type errors statically in CLP programs. The system introduces a type discipline on the way CLP programs and libraries can be composed, while still maintaining the ability to type meta-programming predicates, thanks to the flexibility of subtyping. We show that subject reduction holds under very general assumptions.... (Update)

Similar documents (at the sentence level):
5.8%:   Statically Typing CLP Programs - Fages, Paltrinieri (1997)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Typed Constraint Logic Programs: checking domain coercions.. - Coquery, Fages   (Correct)
0.3:   From Typing Constraints to Typed Constraint Systems in CHR - Coquery, Fages (2001)   (Correct)
0.3:   Type Checking and Type Inferencing for Logic Programs with.. - Meyer (1996)   (Correct)

Similar documents based on text:   More   All
0.5:   Typing Constraint Logic Programs - Fages, Coquery   (Correct)
0.2:   Analysis of normal CLP programs - Fages, Gori (1997)   (Correct)
0.2:   Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ fages-generic,
  author = "François Fages and Massimo Paltrinieri",
  title = "A Generic Type System for CLP(X)",
  url = "citeseer.ist.psu.edu/10755.html" }
Citations (may not include all citations):
561   Constraint Logic Programming (context) - Jaffar, Lassez - 1987
373   Constraint Logic Programming: A Survey - Jaffar, Maher - 1994
187   Type Inclusion Constraints and Type Inference - Aiken, Wimmers - 1993
179   The Godel programming language (context) - Hill, Lloyd - 1994
129   ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
109   A Polymorphic Type System for Prolog (context) - Mycroft, O'Keefe - 1984
93   Feature Constraint Logics for Unification Grammars - Smolka - 1992
61   Logic Programming over Polymorphically Order-Sorted Types - Smolka - 1989
55   The Undecidability of the SemiUnification Problem (context) - Kfoury, Tiruyn et al.
43   Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Kee.. (context) - Lakshman, Reddy - 1991
41   Type inference with subtypes (context) - Fuh, Mishra - 1988
33   A semantics for typed logic programs (context) - Hill, Topor - 1992
30   Lower Bounds on Type Inference with Subtypes (context) - Hoang, Mitchell - 1995
25   Type checking higher-order polymorphic multimethods - Bourdoncle, Merz - 1997
20   Satisfying Subtype Inequalities in Polynomial Space - Frey - 1997
17   Type Inferencing for Polymorphic Order-Sorted Logic Programs - Beierle - 1995
12   Parametric Order-Sorted Types in Logic Programming (context) - Hanus - 1991
12   Order-Sorted Feature Theory Unification (context) - Ait-Kaci, Podelski et al. - 1997
10   Logic Programming with Type Specifications (context) - Hanus - 1992
10   Specification of Prolog IV (context) - Colmerauer - 1996
8   Type Checking and Type Inferencing for Logic Programs with S.. - Meyer - 1996
5   An Introduction to LIFE - Programming with logic (context) - Ait-Kaci - 1993
4   LOGIN: A Logical Programming Language with Built-in Inherita.. (context) - Ait-Kaci, Nasr - 1986
2   Logic Programming with Polymprphically Order-Sorted Types (context) - Smolka - 1988
1   Polymorphic Subtype Inference; Closing the Theory-Practice G.. (context) - Fuh, Mishra - 1989

Documents on the same site (http://www.ens.fr/~fages/papers.html):   More
Constructive Negation by Pruning - Fages (1994)   (Correct)
Un Modèle D'exécution Réactif Et.. - Fowler, Sola, Fages   (Correct)
Handling preferences in Constraint Logic Programming with.. - Fages, Fowler, Sola (1994)   (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