Sciweavers

3470 search results - page 605 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
192
Voted
POPL
2008
ACM
16 years 1 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
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...
Nils Anders Danielsson
198
Voted
POPL
2008
ACM
16 years 1 months ago
A theory of contracts for web services
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...
Giuseppe Castagna, Nils Gesbert, Luca Padovani
221
Voted
POPL
2002
ACM
16 years 1 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers
125
Voted
CADE
2007
Springer
16 years 1 months ago
Dependency Pairs for Rewriting with Non-free Constructors
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...
Stephan Falke, Deepak Kapur
102
Voted
PODS
2008
ACM
158views Database» more  PODS 2008»
16 years 25 days ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...