Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar3. PLILP 1991: Passau, Germany
Jan Maluszynski, Martin Wirsing:
Programming Language Implementation and Logic Programming, 3rd International Symposium, PLILP'91, Passau, Germany, August 26-28, 1991, Proceedings. Lecture Notes in Computer Science 528, Springer 1991, ISBN 3-540-54444-5
Invited Lecture
Andrew W. Appel, David B. MacQueen:
Standard ML of New Jersey. 1-13
Functional and Logic Programming
Lee Naish:
Adding equations to NU-Prolog. 15-26Susumu Yamasaki:
Extraction of Functional from Logic Program. 27-38
Integration of Programming Concepts I
Heinz Kredel:
The MAS Specification Component. 39-50T. C. Nicholas Graham, Gerd Kock:
Domesticating Imperative Constructs So That They Can Live in a Functional World. 51-62
Compiler Construction I
Arnd Poetzsch-Heffter:
Logic-Based Specification of Visibility Rules. 63-74M. Anton Ertl, Andreas Krall:
Optimal Instruction Scheduling using Constraint Logic Programming. 75-86
Parallel Implementations
Fabrizio Baiardi, D. M. Bella:
An Architectural Model for OR-Parallelism on Distributed Memory Systems. 87-98Koen Langendoen, Willem G. Vree:
FRATS: A Parallel Reduction Strategy for Shared Memory. 99-110
Narrowing
María Alpuente, Moreno Falaschi:
Narrowing as an Incremental Constraint Satisfaction Algorithm. 111-122Manuel M. T. Chakravarty, Hendrik C. R. Lock:
The Implementation of Lazy Narrowing. 123-134
Semantics
Charles Consel, Siau-Cheng Khoo:
Semantics-Directed Generation of a Prolog Compiler. 135-146Egon Börger, Bart Demoen:
A Framework to Specify Database Update Views for Prolog. 147-158
Modular Logic Programming
Szabolcs Ferenczi:
Concepts for a Modular and Distributed Prolog Language. 159-170Andrew Davison:
From Parlog to Polka in two easy Steps. 171-182
Compiler Construction II
Annika Aasa:
Precedences in Specifications and Implementations of Programming Languages. 183-194Christoph W. Keßler, Wolfgang J. Paul, Thomas Rauber:
A Randomized Heuristic Approach to Register Allocation. 195-206Nicolas Halbwachs, Pascal Raymond, Christophe Ratel:
Generating Efficient Code From Data-Flow Programs. 207-218
Grammars
Cornelis H. A. Koster, Jean Beney:
On the Borderline Between Grammars and Programs. 219-230Harald Vogt, S. Doaitse Swierstra, Matthijs F. Kuiper:
Efficient Incremental Evaluation of Higher order Attribute Grammars. 231-242Jukka Paakki:
PROFIT: A System Integrating Logic Programming and Attribute Grammars. 243-254
Invited Lecture
Hassan Aït-Kaci, Andreas Podelski:
Towards a Meaning of LIFE. 255-274
Extensions of Logic Programming
Paul Y. Gloess:
U-Log, An Ordered Sorted Logic with Typed Attributes. 275-286Weidong Chen, David Scott Warren:
Compilation of Predicate Abstractions in Higher-Order Logic Programming. 287-298
Abstract Interpretation
Ulf Nilsson:
Abstract Interpretation: A Kind of Magic. 299-309Gilberto Filé, P. Sottero:
Abstract Interpretation for Type Checking. 311-322Fosca Giannotti, Manuel V. Hermenegildo:
A Technique for Recursive Invariance Detection and Selective Program Specification. 323-334
Optimization Techniques
Rita Loogen, Stephan Winkler:
Dynamic Detection of Determinism in Functional Languages. 335-346Maurizio Proietti, Alberto Pettorossi:
Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. 347-358
Integration of Programming Concepts II
P. H. Cheong, Laurent Fribourg:
Efficient Integration of Simplifications into Prolog. 359-370Sergio Antoy:
Lazy Evaluation in Logic. 371-382Johan Boye:
S-SLD-resolution - An Operational Semantics for Logic Programs with External Procedures. 383-393
Constraint Logic Programming
Pascal Van Hentenryck, Yves Deville:
Operational Semantics of Constraint Logic Programming over Finite Domains. 395-406Antonio Brogi, Maurizio Gabbrielli:
Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes. 407-418
System Demonstrations
Diego Loyola:
Extending Execution Trees for Debugging and Animation in Logic Programming. 419-420Ulrich Fraus, Heinrich Hußmann:
A Narrowing-Based Theorem Prover. 421-422Michael Hanus:
The ALF System. 423-424Jürgen Vollmer:
Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming. 425-426Beate Baum, Peter Forbrig:
The System FLR (Fast Laboratory for Recomposition). 427-428Giuseppe Attardi, Mauro Gaspari:
Multilanguage Interoperability. 429-430Bruno Legeard, Emmanuel Legros:
Short Overview of the CLPS System. 431-433
last updated on 2019-10-12 22:26 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
