Functional and Logic Programming 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kameyama, Yukiyoshi (Επιμελητής έκδοσης), Stuckey, Peter J. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
Σειρά:Lecture Notes in Computer Science, 2998
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03302nam a22005295i 4500
001 978-3-540-24754-8
003 DE-He213
005 20151204155755.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 |a 9783540247548  |9 978-3-540-24754-8 
024 7 |a 10.1007/b96926  |2 doi 
040 |d GrThAP 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Functional and Logic Programming  |h [electronic resource] :  |b 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings /  |c edited by Yukiyoshi Kameyama, Peter J. Stuckey. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2004. 
300 |a X, 307 p.  |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 2998 
505 0 |a Invited Papers -- A Brief Survey of Quantum Programming Languages -- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic -- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework -- Refereed Papers Logic and Functional-Logic Programming -- Online Justification for Tabled Logic Programs -- Constructive Intensional Negation -- Analysing Definitional Trees: Looking for Determinism -- Applications -- : a Declarative Debugging Tool for Functional-Logic Languages -- LIX: an Effective Self-applicable Partial Evaluator for Prolog -- Program Analysis -- Multivariant Non-failure Analysis via Standard Abstract Interpretation -- Set-Sharing Is Not Always Redundant for Pair-Sharing -- Backward Pair Sharing Analysis -- Rewriting -- Implementing Natural Rewriting and Narrowing Efficiently -- Complete Axiomatization of an Algebraic Construction of Graphs -- Sub-Birkhoff -- Types and Modules -- Relaxing the Value Restriction -- Rigid Mixin Modules -- Logic and Semantics -- Semantics of Linear Continuation-Passing in Call-by-Name -- A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus -- Functional Programming -- Normalization by Evaluation for ? ?2 -- Basic Pattern Matching Calculi: a Fresh View on Matching Failure -- Derivation of Deterministic Inverse Programs Based on LR Parsing. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computer logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
700 1 |a Kameyama, Yukiyoshi.  |e editor. 
700 1 |a Stuckey, Peter J.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540214021 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2998 
856 4 0 |u http://dx.doi.org/10.1007/b96926  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)