Skip to main content

Abstract Partial Deduction Challenged

(Summary)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2664))

Abstract

This short paper (poster) summarises my presentation [6] at this workshop [1] in September 2002. It also reflects some of the discussions at (and some new insights since) the workshop, before this summary went into print.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. F. Bueno & M. Leuschel (Eds.): LOPSTR’02 PreProceedings of the International Workshop on Logic Based Program Development and Transformation (This Workshop). Technical Report, Facultad de Informática, Universidad Politécnica de Madrid (E), September 2002.

    Google Scholar 

  2. F. Fioravanti & A. Pettorossi & M. Proietti: Verification of Sets of Infinite State Processes using Program Transformation. Proc. of LOPSTR’2001, LNCS 2372, Springer, 2002.

    Google Scholar 

  3. F. Fioravanti & A. Pettorossi & M. Proietti: Combining Logic Programs and Monadic Second Order Logic by Program Transformation. This Workshop [1], pp. 166–181.

    Google Scholar 

  4. J. Gallagher: SP System. http://www.cs.bris.ac.uk/~john/software.html

  5. J. Gallagher & J. Peralta: Convex Hull Abstractions in Specialisation of CLP Programs. This Workshop [1], pp. 104–114.

    Google Scholar 

  6. S. Gruner: Abstract Partial Deduction Challenged — Extended Abstract of Ongoing Work. This Workshop [1], pp. 251–258.

    Google Scholar 

  7. L. Lamport: A New Solution to Dijkstra’s Concurrent Programming Problem. Communications of the ACM 17/8, pp. 453–455, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Leuschel: ECCE. http://www.ecs.soton.ac.uk/~mal/systems/ecce.html

  9. M. Leuschel & S. Gruner: Abstract Conjunctive Partial Deduction using Regular Types and its Application to Model Checking. Proc. of LOPSTR’2001, LNCS 2372, Springer, 2002.

    Google Scholar 

  10. P. Mildner: Type Domains for Abstract Interpretation — A Critical Study. Uppsala Theses in Comp. Sc. 31, ISBN 91-506-1345-6, Univ. Uppsala (S), 1999.

    Google Scholar 

  11. G. Snelting: Paul Feyerabend und die Softwaretechnologie. Informatik Spektrum 21/5, pp. 273–276, Springer 1998.

    Article  Google Scholar 

  12. G. Vidal: Curry Partial Evaluator. http://www.dsic.upv.es/users/elp/peval/peval.html

  13. E. Yardeni & E. Shapiro: A Type System for Logic Programs. Journal of Logic Programming 10/2, pp. 125–153, Elsevier, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruner, S. (2003). Abstract Partial Deduction Challenged. In: Leuschel, M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2002. Lecture Notes in Computer Science, vol 2664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45013-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45013-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40438-5

  • Online ISBN: 978-3-540-45013-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics