#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1985

2017

- This year (2)
- Last 5 years (31)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Neil D. Jones, Peter Sestoft, Harald Søndergaard
- RTA
- 1985

The present paper is an extended abstract of (Jones 1985), in which a running , non-trivial partial evaluator is described . As far as we know, this partia l evaluator is the first which has been used in practice to transform interpreters into corresponding stand-alone compilers, or to generate a compile r generator by transforming itself . A partial… (More)

- Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard
- Sci. Comput. Program.
- 1998

Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, niteness analysis and functional dependency analysis for databases. We identify two classes of Boolean… (More)

- Neil D. Jones, Peter Sestoft, Harald Søndergaard
- Lisp and Symbolic Computation
- 1989

- Kim Marriott, Harald Søndergaard
- LOPLAS
- 1993

We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as “approximations” to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the… (More)

- Michael Codish, Harald Søndergaard, Peter J. Stuckey
- ACM Trans. Program. Lang. Syst.
- 1999

We investigate Jacobs and Langen's Sharing domain, introduced for the analysis of variable sharing in logic programs, and show that it is isomorphic to Marriott and Søndergaard's Pos domain, introduced for the analysis of groundness dependencies. Our key idea is to view the sets of variables in a Sharing domain element as the models of a corresponding… (More)

- Harald Søndergaard
- ESOP
- 1986

- Andy King, Harald Søndergaard
- VMCAI
- 2010

One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation c · x = d mod m, m is a power of two, c is a vector of integer coefficients, and x is a vector of propositional variables (bits).… (More)

- Kim Marriott, Harald Søndergaard, Neil D. Jones
- ACM Trans. Program. Lang. Syst.
- 1994

Logic-programming languages are based on a principle of separation “logic” and “control.”. This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism (or proof procedure, viewing execution as theorem proving). Although the separation is desirable from a semantical point of… (More)

- Kim Marriott, Harald Søndergaard
- IFIP Congress
- 1989

The increased acceptance of Prolog has motivated widespread interest in the semanticsbased dataflow analysis of logic programs and a number of different approaches have been suggested. However, the relationships between these approaches are not clear. The present paper provides a unifying introduction to the approaches by giving novel denotational semantic… (More)