Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCID3. 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-26 - Susumu Yamasaki:
Extraction of Functional from Logic Program. 27-38
Integration of Programming Concepts I
- Heinz Kredel:
The MAS Specification Component. 39-50 - T. 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-74 - M. 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-98 - Koen 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-122 - Manuel 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-146 - Egon 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-170 - Andrew 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-194 - Christoph W. Keßler, Wolfgang J. Paul, Thomas Rauber:
A Randomized Heuristic Approach to Register Allocation. 195-206 - Nicolas 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-230 - Harald Vogt, S. Doaitse Swierstra, Matthijs F. Kuiper:
Efficient Incremental Evaluation of Higher order Attribute Grammars. 231-242 - Jukka 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-286 - Weidong 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-309 - Gilberto Filé, P. Sottero:
Abstract Interpretation for Type Checking. 311-322 - Fosca 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-346 - Maurizio 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-370 - Sergio Antoy:
Lazy Evaluation in Logic. 371-382 - Johan 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-406 - Antonio 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-420 - Ulrich Fraus, Heinrich Hußmann:
A Narrowing-Based Theorem Prover. 421-422 - Michael Hanus:
The ALF System. 423-424 - Jürgen Vollmer:
Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming. 425-426 - Beate Baum, Peter Forbrig:
The System FLR (Fast Laboratory for Recomposition). 427-428 - Giuseppe Attardi, Mauro Gaspari:
Multilanguage Interoperability. 429-430 - Bruno Legeard, Emmanuel Legros:
Short Overview of the CLPS System. 431-433
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2022-06-30 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
