The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Programming Language Implementation and Logic Programming (PLILP) (plilp)
1991 (conf/plilp/91)

  1. Andrew W. Appel, David B. MacQueen
    Standard ML of New Jersey. [Citation Graph (1, 0)][DBLP]
    PLILP, 1991, pp:1-13 [Conf]
  2. Lee Naish
    Adding equations to NU-Prolog. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:15-26 [Conf]
  3. Susumu Yamasaki
    Extraction of Functional from Logic Program. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:27-38 [Conf]
  4. Heinz Kredel
    The MAS Specification Component. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:39-50 [Conf]
  5. T. C. Nicholas Graham, Gerd Kock
    Domesticating Imperative Constructs So That They Can Live in a Functional World. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:51-62 [Conf]
  6. Arnd Poetzsch-Heffter
    Logic-Based Specification of Visibility Rules. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:63-74 [Conf]
  7. M. Anton Ertl, Andreas Krall
    Optimal Instruction Scheduling using Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:75-86 [Conf]
  8. Fabrizio Baiardi, D. M. Bella
    An Architectural Model for OR-Parallelism on Distributed Memory Systems. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:87-98 [Conf]
  9. Koen Langendoen, Willem G. Vree
    FRATS: A Parallel Reduction Strategy for Shared Memory. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:99-110 [Conf]
  10. María Alpuente, Moreno Falaschi
    Narrowing as an Incremental Constraint Satisfaction Algorithm. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:111-122 [Conf]
  11. Manuel M. T. Chakravarty, Hendrik C. R. Lock
    The Implementation of Lazy Narrowing. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:123-134 [Conf]
  12. Charles Consel, Siau-Cheng Khoo
    Semantics-Directed Generation of a Prolog Compiler. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:135-146 [Conf]
  13. Egon Börger, Bart Demoen
    A Framework to Specify Database Update Views for Prolog. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:147-158 [Conf]
  14. Szabolcs Ferenczi
    Concepts for a Modular and Distributed Prolog Language. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:159-170 [Conf]
  15. Andrew Davison
    From Parlog to Polka in two easy Steps. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:171-182 [Conf]
  16. Annika Aasa
    Precedences in Specifications and Implementations of Programming Languages. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:183-194 [Conf]
  17. Christoph W. Keßler, Wolfgang J. Paul, Thomas Rauber
    A Randomized Heuristic Approach to Register Allocation [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:195-206 [Conf]
  18. Nicolas Halbwachs, Pascal Raymond, Christophe Ratel
    Generating Efficient Code From Data-Flow Programs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:207-218 [Conf]
  19. Cornelis H. A. Koster, Jean Beney
    On the Borderline Between Grammars and Programs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:219-230 [Conf]
  20. Harald Vogt, S. Doaitse Swierstra, Matthijs F. Kuiper
    Efficient Incremental Evaluation of Higher order Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:231-242 [Conf]
  21. Jukka Paakki
    PROFIT: A System Integrating Logic Programming and Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:243-254 [Conf]
  22. Hassan Aït-Kaci, Andreas Podelski
    Towards a Meaning of LIFE. [Citation Graph (2, 0)][DBLP]
    PLILP, 1991, pp:255-274 [Conf]
  23. Paul Y. Gloess
    U-Log, An Ordered Sorted Logic with Typed Attributes. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:275-286 [Conf]
  24. Weidong Chen, David Scott Warren
    Compilation of Predicate Abstractions in Higher-Order Logic Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:287-298 [Conf]
  25. Ulf Nilsson
    Abstract Interpretation: A Kind of Magic. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:299-309 [Conf]
  26. Gilberto Filé, P. Sottero
    Abstract Interpretation for Type Checking. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:311-322 [Conf]
  27. Fosca Giannotti, Manuel V. Hermenegildo
    A Technique for Recursive Invariance Detection and Selective Program Specification. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:323-334 [Conf]
  28. Rita Loogen, Stephan Winkler
    Dynamic Detection of Determinism in Functional Languages. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:335-346 [Conf]
  29. Maurizio Proietti, Alberto Pettorossi
    Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:347-358 [Conf]
  30. P. H. Cheong, Laurent Fribourg
    Efficient Integration of Simplifications into Prolog. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:359-370 [Conf]
  31. Sergio Antoy
    Lazy Evaluation in Logic. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:371-382 [Conf]
  32. Johan Boye
    S-SLD-resolution - An Operational Semantics for Logic Programs with External Procedures. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:383-393 [Conf]
  33. Pascal Van Hentenryck, Yves Deville
    Operational Semantics of Constraint Logic Programming over Finite Domains. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:395-406 [Conf]
  34. Antonio Brogi, Maurizio Gabbrielli
    Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:407-418 [Conf]
  35. Diego Loyola
    Extending Execution Trees for Debugging and Animation in Logic Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:419-420 [Conf]
  36. Ulrich Fraus, Heinrich Hußmann
    A Narrowing-Based Theorem Prover. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:421-422 [Conf]
  37. Michael Hanus
    The ALF System. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:423-424 [Conf]
  38. Jürgen Vollmer
    Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:425-426 [Conf]
  39. Beate Baum, Peter Forbrig
    The System FLR (Fast Laboratory for Recomposition). [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:427-428 [Conf]
  40. Giuseppe Attardi, Mauro Gaspari
    Multilanguage Interoperability. [Citation Graph (0, 0)][DBLP]
    PLILP, 1991, pp:429-430 [Conf]
  41. Bruno Legeard, Emmanuel Legros
    Short Overview of the CLPS System. [Citation Graph (1, 0)][DBLP]
    PLILP, 1991, pp:431-433 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002