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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Escobar, Santiago (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 5979
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02844nam a22005415i 4500
001 978-3-642-11999-6
003 DE-He213
005 20151204170104.0
007 cr nn 008mamaa
008 100316s2010 gw | s |||| 0|eng d
020 |a 9783642119996  |9 978-3-642-11999-6 
024 7 |a 10.1007/978-3-642-11999-6  |2 doi 
040 |d GrThAP 
050 4 |a QA8.9-QA10.3 
072 7 |a UYA  |2 bicssc 
072 7 |a MAT018000  |2 bisacsh 
072 7 |a COM051010  |2 bisacsh 
082 0 4 |a 005.131  |2 23 
245 1 0 |a Functional and Constraint Logic Programming  |h [electronic resource] :  |b 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers /  |c edited by Santiago Escobar. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a IX, 179 p. 35 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5979 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Software Engineering. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
700 1 |a Escobar, Santiago.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642119989 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5979 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11999-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)