Sciweavers

3481 search results - page 317 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
ICFP
2003
ACM
16 years 4 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
FOSSACS
2006
Springer
15 years 8 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
LATA
2009
Springer
15 years 11 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
ENTCS
2008
73views more  ENTCS 2008»
15 years 4 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla