Principles and Practice of Declarative Programming [electronic resource] : International Conference, PPDP’99, Paris, France, September, 29 - October 1, 1999. Proceedings / edited by Gopalan Nadathur.
Material type: TextSeries: Lecture Notes in Computer Science ; 1702Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999Description: X, 442 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540481645Subject(s): Computer science | Logic design | Computer Science | Programming Languages, Compilers, Interpreters | Logics and Meanings of Programs | Programming TechniquesAdditional physical formats: Printed edition:: No titleDDC classification: 005.13 LOC classification: QA76.7-76.73QA76.76.C65Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK6340 |
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.
There are no comments on this title.