FEEDBACK Smiley face
Normal view MARC view ISBD view

Logic Based Program Synthesis and Transformation [electronic resource] :10th International Workshop, LOPSTR 2000 London, UK, July 24–28, 2000 Selected Papers /

By: Lau, Kung-Kiu [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2042Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.Description: VIII, 188 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540451426.Subject(s): Computer science | Software engineering | Computer programming | Computer logic | Mathematical logic | Artificial intelligence | Computer Science | Software Engineering/Programming and Operating Systems | Logics and Meanings of Programs | Programming Techniques | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
Contents:
Synthesis -- A Formal Framework for Synthesis and Verification of Logic Programs -- Protocols between Programs and Proofs -- Protocols between Programs and Proofs -- A Technique for Modular Logic Program Refinement -- A Technique for Modular Logic Program Refinement -- Transformation -- Higher-Order Transformation of Logic Programs -- Analysis -- Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings -- Specialisation -- A Model for Inter-module Analysis and Optimizing Compilation -- Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages -- Automated Strategies for Specializing Constraint Logic Programs -- Abstract Interpretation -- Measuring the Precision of Abstract Interpretations -- Debugging -- Specifying Prolog Trace Models with a Continuation Semantics.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Synthesis -- A Formal Framework for Synthesis and Verification of Logic Programs -- Protocols between Programs and Proofs -- Protocols between Programs and Proofs -- A Technique for Modular Logic Program Refinement -- A Technique for Modular Logic Program Refinement -- Transformation -- Higher-Order Transformation of Logic Programs -- Analysis -- Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings -- Specialisation -- A Model for Inter-module Analysis and Optimizing Compilation -- Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages -- Automated Strategies for Specializing Constraint Logic Programs -- Abstract Interpretation -- Measuring the Precision of Abstract Interpretations -- Debugging -- Specifying Prolog Trace Models with a Continuation Semantics.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in