Showing cs.LOShow all
3 papers · 1 filter
cs.LO2001
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
Jan-Georg Smaus
Analysis of (partial) groundness is an important application of abstract interpretation. There are several proposals for improving the precision of such an analysis by exploiting t…
cs.LO2001
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Annalisa Bossi, Sandro Etalle, Sabina Rossi +1
In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed…
cs.LO2001
Well-Typed Logic Programs Are not Wrong
Pierre Deransart, Jan-Georg Smaus
We consider prescriptive type systems for logic programs (as in Goedel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program i…