Christoph Beierle  Home/Search
Context Related
| fernunihagen.de/p...eierle95ICLP.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.fernunih...protos_lit (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if one does not employ the full power of the used type systems. We present a complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types. 1 Introduction It has often... (Update)
Similar documents based on text: More All
0.4: Refinement of a typed WAM extension by polymorphic.. - Beierle, Börger (1996) (Correct)
0.4: Report of the Logic Programming Language PROTOS-L - Beierle, Böttcher, Meyer (1994) (Correct)
0.2: Type Checking and Type Inferencing for Logic Programs with.. - Meyer (1996) (Correct)
Related documents from co-citation: More All
11: A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984
10: A semantics for typed logic programs (context) - Hill, Topor - 1992
9: Logic Programming over Polymorphically Order-Sorted Types - Smolka - 1989
BibTeX entry: (Update)
C. Beierle, Type Inferencing for Polymorphic Order-Sorted Logic Programs, 12th International Conference on Logic Programming, The MIT Press, 765-779, Tokyo, 1995. http://citeseer.ist.psu.edu/beierle95type.html More
@inproceedings{ beierle95type,
author = "Christoph Beierle",
title = "Type Inferencing for Polymorphic Order-Sorted Logic Programs",
booktitle = "International Conference on Logic Programming",
pages = "765-779",
year = "1995",
url = "citeseer.ist.psu.edu/beierle95type.html" }
Citations (may not include all citations):109 A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984
91 Towards a theory of types in Prolog (context) - Mishra - 1984
61 Logic Programming over Polymorphically Order-Sorted Types - Smolka - 1989
46 Types in Logic Programming (context) - Pfenning - 1992
33 A semantics for typed logic programs (context) - Hill, Topor - 1992
31 Horn clause programs with polymorphic types: Semantics and r.. (context) - Hanus - 1989
25 Derivation of polymorphic types for Prolog programs (context) - Zobel - 1987
23 A type inference system for Prolog (context) - Xu, Warren - 1988
16 A polymorphic type system with subtypes for Prolog (context) - Dietrich, Hagl - 1988
14 SEKI-Report SR (context) - Smolka, Version et al. - 1988
12 Run-time type computations in the Warren Abstract Machine (context) - Beierle, Meyer - 1994
10 Logic programming with type specifications (context) - Hanus - 1992
9 Remarks on Remarks on Many-Sorted Equational Logic (context) - Goguen, Meseguer - 1986
8 and applications of a typed logic programming language (context) - Beierle, implementation - 1995
1 Type inferencing for logic programming with polymorphic orde.. (context) - Beierle - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.fernuni-hagen.de/import/pi8/lit/protos_lit.html):
Specification and correctness proof of a WAM extension with.. - Beierle, Börger (1996) (Correct)
Report of the Logic Programming Language PROTOS-L - Beierle, Böttcher, Meyer (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