Buch, Englisch, Band 1702, 442 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1390 g
International Conference, PPDP'99, Paris, France, September, 29 - October 1, 1999, Proceedings
Buch, Englisch, Band 1702, 442 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1390 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-66540-3
Verlag: Springer
of these themes are re?ected in the papers appearing in the present collection.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
Weitere Infos & Material
C-—: A Portable Assembly Language that Supports Garbage Collection.- On Formalised Proofs of Termination of Recursive Functions.- Argument Filtering Transformation.- A Primitive Calculus for Module Systems.- Non-dependent Types for Standard ML Modules.- Constraint Programming in OPL.- Compiling Constraint Handling Rules into Prolog with Attributed Variables.- Parallel Execution Models for Constraint Programming over Finite Domains.- Functional Plus Logic Programming with Built-In and Symbolic Constraints.- A Calculus for Interaction Nets.- Distributed Programming in a Multi-Paradigm Declarative Language.- Logical and Meta-Logical Frameworks.- A Simple and General Method for Integrating Abstract Interpretation in SICStus.- Run Time Type Information in Mercury.- A Virtual Machine for a Process Calculus.- Optimising Bytecode Emulation for Prolog.- OPENLOG: A Logic Programming Language Based on Abduction.- An Operational Semantics of Starlog.- On the Verification of Finite Failure.- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices.- Modular Termination Proofs for Prolog with Tabling.- Declarative Program Transformation: A Deforestation Case-Study.- A Semantic Account of Type-Directed Partial Evaluation.- A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.- Widening Sharing.