Sciweavers

178 search results - page 6 / 36
» An Application of Program Derivation Techniques to 18th-Cent...
Sort
View
PPDP
2010
Springer
13 years 7 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
UIST
2005
ACM
14 years 2 months ago
Artistic resizing: a technique for rich scale-sensitive vector graphics
When involved in the visual design of graphical user interfaces, graphic designers can do more than providing static graphics for programmers to incorporate into applications. We ...
Pierre Dragicevic, Stéphane Chatty, David T...
ICSE
1999
IEEE-ACM
14 years 25 days ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
LISP
2008
104views more  LISP 2008»
13 years 8 months ago
On the implementation of automatic differentiation tools
Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathema...
Christian H. Bischof, Paul D. Hovland, Boyana Norr...
ESOP
2005
Springer
14 years 2 months ago
Determinacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
Lunjin Lu, Andy King