5482 search results - page 319 / 1097 » Logic Programming and Databases |
187
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
202
click to vote
ENTCS
2002
15 years 6 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
168
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
189
click to vote
ICFP
2003
ACM
2003
ACM
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
16 years 6 months ago
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...
155
click to vote
APLAS
2005
ACM
16 years 7 days ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...