3713 search results - page 227 / 743 » Constructing a Calculus of Programs |
119
click to vote
LMCS
2007
15 years 3 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
112
click to vote
ICFP
2001
ACM
16 years 3 months ago
2001
ACM
It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely ...
127
click to vote
ECOOP
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
114
click to vote
ICLP
1994
Springer
15 years 8 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
148
click to vote
SAC
2010
ACM
15 years 1 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...