Conferences in DBLP
Andrew W. Appel , David B. MacQueen Standard ML of New Jersey. [Citation Graph (1, 0)][DBLP ] PLILP, 1991, pp:1-13 [Conf ] Lee Naish Adding equations to NU-Prolog. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:15-26 [Conf ] Susumu Yamasaki Extraction of Functional from Logic Program. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:27-38 [Conf ] Heinz Kredel The MAS Specification Component. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:39-50 [Conf ] 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 ] Arnd Poetzsch-Heffter Logic-Based Specification of Visibility Rules. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:63-74 [Conf ] M. Anton Ertl , Andreas Krall Optimal Instruction Scheduling using Constraint Logic Programming. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:75-86 [Conf ] 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 ] Koen Langendoen , Willem G. Vree FRATS: A Parallel Reduction Strategy for Shared Memory. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:99-110 [Conf ] María Alpuente , Moreno Falaschi Narrowing as an Incremental Constraint Satisfaction Algorithm. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:111-122 [Conf ] Manuel M. T. Chakravarty , Hendrik C. R. Lock The Implementation of Lazy Narrowing. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:123-134 [Conf ] Charles Consel , Siau-Cheng Khoo Semantics-Directed Generation of a Prolog Compiler. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:135-146 [Conf ] 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 ] Szabolcs Ferenczi Concepts for a Modular and Distributed Prolog Language. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:159-170 [Conf ] Andrew Davison From Parlog to Polka in two easy Steps. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:171-182 [Conf ] Annika Aasa Precedences in Specifications and Implementations of Programming Languages. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:183-194 [Conf ] 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 ] Nicolas Halbwachs , Pascal Raymond , Christophe Ratel Generating Efficient Code From Data-Flow Programs. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:207-218 [Conf ] Cornelis H. A. Koster , Jean Beney On the Borderline Between Grammars and Programs. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:219-230 [Conf ] 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 ] Jukka Paakki PROFIT: A System Integrating Logic Programming and Attribute Grammars. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:243-254 [Conf ] Hassan Aït-Kaci , Andreas Podelski Towards a Meaning of LIFE. [Citation Graph (2, 0)][DBLP ] PLILP, 1991, pp:255-274 [Conf ] Paul Y. Gloess U-Log, An Ordered Sorted Logic with Typed Attributes. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:275-286 [Conf ] 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 ] Ulf Nilsson Abstract Interpretation: A Kind of Magic. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:299-309 [Conf ] Gilberto Filé , P. Sottero Abstract Interpretation for Type Checking. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:311-322 [Conf ] 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 ] Rita Loogen , Stephan Winkler Dynamic Detection of Determinism in Functional Languages. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:335-346 [Conf ] 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 ] P. H. Cheong , Laurent Fribourg Efficient Integration of Simplifications into Prolog. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:359-370 [Conf ] Sergio Antoy Lazy Evaluation in Logic. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:371-382 [Conf ] 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 ] 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 ] Antonio Brogi , Maurizio Gabbrielli Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:407-418 [Conf ] Diego Loyola Extending Execution Trees for Debugging and Animation in Logic Programming. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:419-420 [Conf ] Ulrich Fraus , Heinrich Hußmann A Narrowing-Based Theorem Prover. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:421-422 [Conf ] Michael Hanus The ALF System. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:423-424 [Conf ] Jürgen Vollmer Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:425-426 [Conf ] Beate Baum , Peter Forbrig The System FLR (Fast Laboratory for Recomposition). [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:427-428 [Conf ] Giuseppe Attardi , Mauro Gaspari Multilanguage Interoperability. [Citation Graph (0, 0)][DBLP ] PLILP, 1991, pp:429-430 [Conf ] Bruno Legeard , Emmanuel Legros Short Overview of the CLPS System. [Citation Graph (1, 0)][DBLP ] PLILP, 1991, pp:431-433 [Conf ]