Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars

@inproceedings{Tarau1995BacktrackableSW,
  title={Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars},
  author={Paul Tarau and Ver{\'o}nica Dahl and Andrew Fall},
  booktitle={ILPS},
  year={1995}
}
A set of executable speciications and eecient implementations of backtrackable state persisting over the current AND-continuation is investigated. At speciication level, our primitive operations are a variant of linear and intu-itionistic implications, having as consequent the current continuation. On top of them, we introduce a form of hypothetical assumptions which use no explicit quan-tiiers and have an easy and eecient implementation on top of logic programming systems featuring… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Backtrackable State withLinear Assumptions , Continuations and Hidden Accumulator Grammars

Peter Van Roy.
  • Technical Report 952 , D  epartement d ' Informatique , Universit  e deMoncton , April
  • 1995

Linear logic

J.-Y. Girard.
  • Theoretical Computer Science
  • 1995

Towards a meaning of LIFE

H. Baker.
  • Journal ofLogic Programming
  • 1993

Continuations in  Prolog

O. Ridoux.
  • 1992

Logic programming in a fragment of intuitionistic linear logic

  • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991

A useful extension to Prolog ' s De nite Clause Grammarnotation

Philip Wadler.
  • SIGPLAN notices
  • 1989

Similar Papers

Loading similar papers…