UID:
almahu_9947364259302882
Umfang:
IX, 179 p. 35 illus.
,
online resource.
ISBN:
9783642119996
Serie:
Lecture Notes in Computer Science, 5979
Anmerkung:
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 eBooks
Weitere Ausg.:
Printed edition: ISBN 9783642119989
Sprache:
Englisch
DOI:
10.1007/978-3-642-11999-6
URL:
http://dx.doi.org/10.1007/978-3-642-11999-6
