641 search results - page 46 / 129 » Embedding Finite Sets in a Logic Programming Language |
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
LOPSTR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
RULEML
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
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...