3481 search results - page 564 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
126
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
222
click to vote
POPL
2008
ACM
16 years 3 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...
225
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
256
click to vote
POPL
2002
ACM
16 years 3 months ago
2002
ACM
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
150
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...