Sciweavers

275 search results - page 48 / 55
» Non-Termination Inference of Logic Programs
Sort
View
HASKELL
2006
ACM
15 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
SCAM
2003
IEEE
15 years 3 months ago
Unique Renaming of Java Using Source Transformation
This paper presents a flexible way in which a deisgn model extracted from Java programs can remain unified with the source code. Each entity declaration and reference in the Java ...
Xinping Guo, James R. Cordy, Thomas R. Dean
POPL
2007
ACM
15 years 10 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
81
Voted
PLDI
2010
ACM
15 years 7 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
ENC
2005
IEEE
15 years 3 months ago
SKIMA: Semantic Knowledge and Information Management
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
Héctor Pérez-Urbina, Gennaro Bruno, ...