Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
This paper presents a mapping solution from ERDF(S) to Take vocabulary. The work is related to an investigation of integrating ERDF Derivation Rules into Take inference engine. Som...
Ion-Mircea Diaconescu, Adrian Giurca, Gerd Wagner,...