PROLOG-REQUEST@SU-SCORE.ARPA (Chuck Restivo, The Moderator) (11/05/86)
PROLOG Digest Thursday, 6 Nov 1986 Volume 4 : Issue 66
Today's Topics:
LP Library - Declarative Language Bibliography, Part N
----------------------------------------------------------------------
Date: Wed 5 Nov 86 10:35:22-PST
From: Chuck Restivo <Restivo@Score.Stanford.EDU>
Subject: Lauren Smith's Bibliography, Part N
NAGAI84a
Nagai Y. & Chikira H. & Kobayashi M. & Furukawa K.
Problems in Developing an Experimental System Able
to Reuse Existing Programs
ICOT Research Center, Technical Memorandum TM-0059
April 1984
NAGAS85a *
Nagasawa I.
A Method of Representing Processes in a Constraint
Solver
in WADA86a, pp 266-275
1985
NAKA?? *
Nakazaki R. & Konagaya A. & Habata S. & Shimazu H.
& Uemura M. & Yamamoto M. & Yokota M. & Chikayama M.
Design of a High-Speed Prolog Machine (HPM)
ICOT Research Center, Technical Memorandum TM-0105
NAIS83a *
Naish L.
Automatic Control For Logic Programs
Technical Report 83/6
(Revised and title changed September 1984)
Department of Computer Science, University of Melbourne
1983
NAIS84a *
Naish L.
Heterogenous SLD Resolution
Technical Report 84/1
Department of Computer Science, University of Melbourne
(Also in Journal of Logic Programming)
revised June 1984
NAIS84b *
Naish L.
All Solutions Predicates In Prolog
Technical Report 84/4
Deaprtment of Computer Science, University of Melbourne
1984
NAIS84c *
Naish L.
Heterogenous SLD Resolution
Journal of Logic Programming, Vol 1, No 4, pp 297-303
December 1984
NAKAG84a *
Nakagawa H.
And Parallel PROLOG with Divided Assertion Set
1984 International Symposium on Logic Programming
pp 22-28
6 February 1984
NAKAM84a *
Makamura K.
Associative Concurrent Evaluation of Logic Programs
Journal of Logic Programming, Vol 1, No 4, pp 285-295
Decemeber 1984
NAKAM85a
Nakamura K.
Book Review
"Introduction to Logic Programming" by C.J. Hogger,
Academic Press, 290 pages, 1984
New Generation Computing, Vol 3, No 4, pp 487
1985
NAKAM85b *
Nakamura K.
Heuristic Prolog : Logic Program Execution by Heuristic
Search
in WADA86a, pp 148-155
1985
NAKAS85a
Nakashima H. & DeGroot D.
Conference Report
A Report on 1985 International Symposium on Logic
Programming
New Generation Computing, Vol 3, No 4, pp 488-489
1985
NARA86a *
Narayanan A.
Slip Into LISP: How To Choose A LISP Interpreter
Artificial Intelligence Review, Vol 1, No 1, pp 53-68
1986
NATA86a*
Natarajan N.
A Distributed Synchronisation Scheme for Communicating
Processes
Computer Journal, Vol 29, No 2, pp 109-117
April 1986
NGUY80a *
Nguyen V.L. & Lassez J-L.
Transfinite Computational Induction and a Dual Problem
to Least Fixed Points
Technical Report 80/5
Department of Computer Science, University of Melbourne
1980
NICH86a *
Nichols W.
OBJ As A Meta-Language For Denotational Semantics
presented at The Alvey SIG FM One Day Colloquium on The
Specification Language OBJ And Applications,
Imperial College
Friday, 18th April, 1986
NIEL82a *
Nielson F.
A Denotational Framework for Data Flow Analysis
Acta Informatica 18, pp 265-287
Springer-Verlag
1982
NIEL84a *
Nielson F.
Abstract Interpretation Using Domain Theory
Department of Computer Science, University of Edinburgh
Phd Thesis, CST-31-84
October 1984
NIEL85a *
Nielson F.
Program Transformation in a Denotational Setting
ACM Transactions on Programming Languages and Systems
Vol 7, no 3, pp 359-379
July 1985
NIEL86a *
Nielson F.
Abstract Interpretation of Denotational Definitions
( A Survey )
Proc. from STACS 86, LNCS vol 210, pp 1-20
Springer-Verlag
1986
NIEL?? *
Nielson F.
A Bibliography On Abstract Interpretation
NIEL?? *
Nielson F.
Tensor Products Generalize the Relational Data Flow
Analysis Method
Proc. Fourth Hung. Computer Sci. Conf.
( eds. Arato M. & Katai I. & Varga L. )
pp 211-225
NIEL?? *
Nielson F.
Expected Forms of Data Flow Analyses
NILS83a *
Nilsson J.F.
On The Compilation Of A Domain-Based Prolog
Information Processing 83, pp 293-298
1983
NILS86a *
Nilsson U.
An Alternative Implementation of DCGs
Examensarbete, LITH-IDA-EX-8607
Department of Computer and Information Science,
Linkoping University, Sweden
24 March 1986
NIPK85a *
Nipkow T.
Non-Deterministic Data Types: Models and Implementations
Dept of Comp Sci, Univ of Manchester, Technical Report
UMCS-85-10-1
October 1985
NISH83a
Nishikawa H. & Yokota M. & Yamamoto A. & Taki K. & Uchida S.
The Personal Inference Machine (PSI) : Its design Philosophy
and Machine Architecture
( Also in "Proceedings of Logic Programming Workshop, '83",
Portugal 1983 )
ICOT Research center, Technical report TR-013
June 1983
NITT85a *
Nitta K. & Nagao J.
KRIP : A Knowledge Representation System for Laws Relating to
Industrial Property
in WADA86a, pp 276-286
1985
NIVA82a
Nivat M.
Behaviours of Processes and Synchronised Systems of Processes
in BROY82a, pp 473-550
1982
NODA85a *
Noda Y. & Kinoshita T. & Okumura A. & Hirano T. & Hiruta T.
A Parallel Logic Simulator Based on Concurrent Prolog
in WADA86a, pp 256-265
1985
NORD83a *
Nordstrom B. & Smith J.
Why Type Theory For Programming ? A Short Introduction
Declarative Programming Workshop, University College London
pp 21-45
11-13th April 1983
NORD83b *
Nordstrom B. & Petersson K.
Types and Specifications
Information Processing 1983, pp 915-920
1983
NORM80a
Norman A. et al
SKIM- The S,K,I Reduction Machine
Proc. LISP Conf.
1980
NORT85a *
North N.D.
A Draft Prolog Glossary
NPL, Teddington
21 August 1985
PS/65
October 1985
NOSH85a *
Noshita K. & Hikita T.
The BC-Chain Method for Representing Combinators
New Generation Computing, Vol 3, No 2, pp 131-144
1985
NOVA85a *
Novak G.S. Jr.
Lisp Programming Lecture Notes
AI-TR-85-06
Artificial Intelligence Laboratory, Department of Computer
Sciences,
University of Texas, Austin
1985
NUMA85a *
Numao N. & Maruyama H.
PROEDIT - A Screen Oriented Prolog Programming Environment
in WADA86a, pp 100-107
1985
NUTE85a *
Nute D.
A Programming Solution To Certain Problems With Loops
In Prolog
ACM SIGPLAN Notices, Vol 20, No 8, pp 32-37
August 1985
------------------------------
End of PROLOG Digest
********************