|
|
|
|
| LEADER |
03010nam a22005415i 4500 |
| 001 |
978-3-540-78769-3 |
| 003 |
DE-He213 |
| 005 |
20170125070335.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2008 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540787693
|9 978-3-540-78769-3
|
| 024 |
7 |
|
|a 10.1007/978-3-540-78769-3
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a UL
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Logic-Based Program Synthesis and Transformation
|h [electronic resource] :
|b 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers /
|c edited by Andy King.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
| 300 |
|
|
|a X, 222 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 4915
|
| 505 |
0 |
|
|a Program Termination -- Proving Termination with (Boolean) Satisfaction -- Termination Analysis of Logic Programs Based on Dependency Graphs -- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation -- Program Transformation -- Towards a Normal Form for Mercury Programs -- Aggregates for CHR through Program Transformation -- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs -- Denotation by Transformation -- Constraint Solving and Analysis -- Generation of Rule-Based Constraint Solvers: Combined Approach -- A Scalable Inclusion Constraint Solver Using Unification -- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs -- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs -- Software Engineering -- Snapshot Generation in a Constructive Object-Oriented Modeling Language -- Synthesis of Data Views for Communicating Processes -- Action Refinement in Process Algebra and Security Issues.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 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 Software Engineering/Programming and Operating Systems.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 700 |
1 |
|
|a King, Andy.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540787686
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4915
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-78769-3
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
