Sciweavers

584 search results - page 88 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Continuations from generalized stack inspection
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
PLDI
2004
ACM
14 years 25 days ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
CADE
2008
Springer
14 years 7 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
POPL
1997
ACM
13 years 11 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
FLOPS
2004
Springer
13 years 11 months ago
LIX: an Effective Self-applicable Partial Evaluator for Prolog
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
Stephen-John Craig, Michael Leuschel