1776 search results - page 23 / 356 » Using a Logic Programming Language with Persistence and Cont... |
POPL
2006
ACM
14 years 7 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
LPNMR
1999
Springer
13 years 11 months ago
1999
Springer
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
ML
2007
ACM
13 years 7 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...