1776 search results - page 163 / 356 » Using a Logic Programming Language with Persistence and Cont... |
130
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
136
click to vote
SAC
1994
ACM
15 years 7 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
117
click to vote
POPL
2000
ACM
15 years 7 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
114
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
157
Voted
ICFP
2012
ACM
13 years 5 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...