Sciweavers

379 search results - page 49 / 76
» Probabilistic (logic) programming concepts
Sort
View
HASKELL
2008
ACM
13 years 11 months ago
Language and program design for functional dependencies
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
Mark P. Jones, Iavor S. Diatchki
PPDP
2007
Springer
14 years 4 months ago
Putting declarative programming into the web: translating curry to javascript
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
Michael Hanus
VMCAI
2010
Springer
14 years 7 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
ICML
2008
IEEE
14 years 10 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 10 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...