Programming Language Implementation and Logic Programming

International Workshop PLILP '90 Linköping, Sweden, August 20–22, 1990 Proceedings

Editors:

ISBN: 978-3-540-53010-7 (Print) 978-3-540-46298-9 (Online)

Table of contents (26 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-15

    Implementing parallel rewriting

  2. No Access

    Book Chapter

    Pages 16-29

    Compilation of narrowing

  3. No Access

    Book Chapter

    Pages 30-44

    Inference-based overloading resolution for ADA

  4. No Access

    Book Chapter

    Pages 45-59

    An approach to verifiable compiling specification and prototyping

  5. No Access

    Book Chapter

    Pages 60-74

    Bug localization by algorithmic debugging and program slicing

  6. No Access

    Book Chapter

    Pages 75-88

    A constraint logic programming shell

  7. No Access

    Book Chapter

    Pages 89-105

    Modifying the simplex algorithm to a constraint solver

  8. No Access

    Book Chapter

    Pages 106-120

    Implementing a meta-logical scheme

  9. No Access

    Book Chapter

    Pages 121-135

    The vienna abstract machine

  10. No Access

    Book Chapter

    Pages 136-150

    A new data structure for implementing extensions to Prolog

  11. No Access

    Book Chapter

    Pages 151-158

    Finding the least fixed point using wait-declarations in Prolog

  12. No Access

    Book Chapter

    Pages 159-173

    Elementary logic programs

  13. No Access

    Book Chapter

    Pages 174-188

    A new presburger arithmetic decision procedure based on extended prolog execution

  14. No Access

    Book Chapter

    Pages 189-203

    Reasoning about programs with effects

  15. No Access

    Book Chapter

    Pages 204-221

    Towards a characterization of termination of logic programs

  16. No Access

    Book Chapter

    Pages 222-237

    Static type analysis of prolog procedures for ensuring correctness

  17. No Access

    Book Chapter

    Pages 238-254

    Integrating strict and lazy evaluation: the λsl-calculus

  18. No Access

    Book Chapter

    Pages 255-276

    Efficient data representation in polymorphic languages

  19. No Access

    Book Chapter

    Pages 277-292

    A logic-based approach to data flow analysis problems

  20. No Access

    Book Chapter

    Pages 293-306

    Systematic semantic approximations of logic programs

previous Page of 2