de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Directional Type Checking for Logic Programs: Beyond Discriminative Types

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44232

Charatonik,  Witold
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Charatonik, W. (2000). Directional Type Checking for Logic Programs: Beyond Discriminative Types. In G. Smolka (Ed.), Proceedings of the 8th European Symposium on Programming (ESOP-00) (pp. 72-87). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3424-4
Zusammenfassung
Directional types form a type system for logic programs which is based on the view of a predicate as a {\em directional procedure\/} which, when applied to a tuple of input terms, generates a tuple of output terms. It is known that directional-type checking wrt.\ arbitrary types is undecidable; several authors proved decidability of the problem wrt.\ discriminative regular types. In this paper, using techniques based on tree automata, we show that directional-type checking for logic programs wrt.\ general regular types is \dexptime-complete and fixed-parameter linear. The letter result shows that despite the exponential lower bound, the type system might be usable in practice.