378 search results - page 52 / 76 » Higher-order transformation of logic programs |
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
POPL
2010
ACM
14 years 10 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
DAGSTUHL
2003
14 years 11 months ago
2003
Abstract. Hydra is a domain-specific language for designing digital circuits, which is implemented by embedding within Haskell. Many features required for hardware specification ...
PADO
2001
Springer
15 years 2 months ago
2001
Springer
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...