Amazon cover image
Image from Amazon.com

Functional and Constraint Logic Programming [electronic resource] : 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers /

Contributor(s): Material type: TextTextSeries: Theoretical Computer Science and General Issues ; 5979Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010Description: IX, 179 p. 35 illus. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642119996
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.131 23
LOC classification:
  • QA267-268.5
Online resources:
Contents:
Invited Papers -- Programming with Multiple Paradigms in Lua -- Constraint Based Strategies -- Contributed Papers -- Integrating ILOG CP Technology into -- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures -- Semantic Labelling for Proving Termination of Combinatory Reduction Systems -- A Taxonomy of Some Right-to-Left String-Matching Algorithms -- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types -- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation -- New Results on Type Systems for Functional Logic Programming -- A Simple Region Inference Algorithm for a First-Order Functional Language -- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions.
In: Springer Nature eBook
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Invited Papers -- Programming with Multiple Paradigms in Lua -- Constraint Based Strategies -- Contributed Papers -- Integrating ILOG CP Technology into -- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures -- Semantic Labelling for Proving Termination of Combinatory Reduction Systems -- A Taxonomy of Some Right-to-Left String-Matching Algorithms -- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types -- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation -- New Results on Type Systems for Functional Logic Programming -- A Simple Region Inference Algorithm for a First-Order Functional Language -- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in