Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 111
AIList Digest Sunday, 4 May 1986 Volume 4 : Issue 111
Today's Topics:
Bibliography - References #5
----------------------------------------------------------------------
Date: 9 Apr 86 13:23:16 GMT
From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs!
abc@ucbvax.berkeley.edu (Andy Cheese)
Subject: Bibliography - References #5
NAKA85a
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
NAKA85b
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
NATA86a*
Natarajan N.
A Distributed Synchronisation Scheme for Communicating Processes
Computer Journal, Vol 29, No 2, pp 109-117
April 1986
NIEL84a *
Nielson F.
Abstract Interpretation Using Domain Theory
Department of Computer Science, University of Edinburgh
Phd Thesis, CST-31-84
October 1984
NIEL *
Nielson F.
A Bibliography On Abstract Interpretation
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
NIVA82a
Nivat M.
Behaviours of Processes and Synchronised Systems of Processes
in BROY82a, pp 473-550
1982
NORM80a
Norman A. et al
SKIM- The S,K,I Reduction Machine
Proc. LISP Conf.
1980
OHSU85a
Ohsuga S. & Yamauchi H.
Multi-Layer Logic - A Predicate Logic Including Data Structure as Knowledge
Representation Language
New Generation Computing, Vol 3, No 4, pp 403-439
1985
ONAI84a
Onai R. & Aso M. & Takeuchi A.
An Approach to a Parallel Inference Machine Based on Control-Driven and
Data-Driven Mechanisms
ICOT Research Center, Technical Report TR-042
January 1984
OSH84
ed. O'Shea T. & Eisenstadt M.
Artificial Intelligence Tools, Techniques and Applications
Harper & Row, Publishers, New York
1984
PATT81a *
Patterson D.A. & Sequin C.H.
RISC 1 : A Reduced Instruction Set VLSI Computer
Proc 8th International Symposium on Computer Architecture
SIGARCH News vol 9, no 3
pp 443-457
1981
PATT82a
Patterson D.A. & Sequin C.H.
A VLSI RISC
Computer Vol 15 No 9, pp 8-21, Sept 1982
PATT84a
Patterson D.A.
VLSI Systems Building: A Berkeley Perspective
Proc. Conf. on Advanced Research in VLSI, MIT
January 1984
PATT85
Patterson D.A.
Reduced Instruction Set Computers
CACM Vol 28, No 1
January 1985
PAUL84a *
Paulson L.C.
Constructing Recursion Operators in Intuitionistic Type Theory
Computing Laboratory, University of Cambridge
Technical Report no 57
October 1984
PAUL85a *
Paulson L.C.
Lessons Learned From LCF: A Survey of Natural Deduction Proofs
Computer Journal, Vol 28, no 5, pp 474-479
1985
PERE79a *
Pereira L.M. & Porto A.
Intelligent Backtracking and Sidetracking in Horn Clause Programs - The Theory
Universidade Nova de Lisboa, Report no 2/79
1979
PERE79b *
Pereira L.M.
Backtracking Intelligently in AND/OR Trees
Universidade Nova de Lisboa, report no 1/79
1979
PEYT82
Peyton Jones S.L.
An Investigation of the Relative Efficiencies of Combinators and
Lambda Expressions
Proc. of ACM LISP Conf 1982 p150-158
PEYT84
Peyton Jones S.L.
Directions in Functional Programming Research
in DUCE84
1984
PEYT85a
Peyton Jones S.L.
GRIP-a parallel graph reduction machine
Dept. of Computer Science, Internal Note 1665, grm.design v1.0, Jan 1985
PEYT85b *
Peyton Jones S.L.
Functional Programming Languages as a Software Engineering Tool
2nd December 1985
PEYT86a *
Peyton Jones S.L.
Parsing Distfix Operators
CACM, Vol 29, no 2, pp 118-122
February 1986
PEIR83
Pier K.A.
A Retrospective on the Dorado, A High Performance Personal Computer
ISL-83-1, Xerox PARC, 1983
PELE84a *
Peleg D.
Communication in Concurrent Dynamic Logic
CS84-15
Dept of Applied Mathematics, Weizmann Institute of Science, Israel
July 1984
PELE84b *
Peleg D.
Concurrent Dynamic Logic
CS84-14
Dept of Applied Mathematics, Weizmann Institute of Science, Israel
July 1984
PING84a
Pingali K. & Arvind
Efficient Demand-Driven Evaluation (I)
Lab. For Computer Science Technical Memo 242
September 1984
PING84b
Pingali K. & Arvind
Efficient Demand-Driven Evaluation (II)
Lab For Computer Science Technical Memo 243
November 1984
PLAI85a *
Plaisted D.A.
The Undecidability of Self-Embedding For Term Rewritng Systems
Information Processing Letters 20, pp 61-64
15 February 1985
PLES85a *
Pless E.
Die Ubersetzung von LISP in die reduktionsprache BRL
GMD 142
March 1985
PLOT76
Plotkin G.D.
A Powerdomain Construction
SIAM J. Comput. 5 3 pp 452-487
September 1976
PLOT82
Plotkin G.D.
A Power Domain For Countable Non-Determinism (Extended Abstract)
Proc 9th Int. Colloq. on Automata, Languages and Programming
Springer Verlag LNCS no 140, pp 418-428
(ed. Nielson M. & Schmidt E.M.)
1982
POON85
Poon E.K. & Peyton Jones S.L.
Cache Memories in a Functional Programming Environment
Dept. of Computer Science, Univ. College London, Internal Note 1680, Jan 1985
PPRG9
Persistent Programming Research Group
Procedures as Persistent Data Objects
Persistent Programming Research Report 9
PPRG11
Persistent Programming Research Group
PS-Algol Abstract Machine Manual
Persistent Programming Research Report 11
PPRG12
Persistent Programming Research Group
PS-Algol Reference Manual Second Edition
Persistent Programming Research Report 12
PRAM85a *
Pramanik S. & King C-T
Computer Journal, Vol 28, no 3, pp 264-269
1985
PRO84a
Prolog: A Tutorial/Review
Microsystems, January 1984, page 104
1984
PULL84a
Pull H.
A HOPE in HOPE Interpreter
BSc. Undergraduate Thesis, Department of Computing, Imperial College
1984
PYKA85a *
Pyka C.
Syntactic Analysis
Forschungstelle fur Informationswissenschaft und Intelligenz,
Universitat Hanburg
LOKI Report NLI - 4.1
November 1985
QUI60a
Quine W.V.O.
Word and Object
MIT Press, Cambridge, 1960
REDD84a
Reddy U.S.
Transformation of Logic Programs into Functional Programs
Proc. 1984 Int'l Symp. on Logic Programming
Feb 1984
REDD85
Reddy U.S.
On The Relationship between Logic and Functional Languages
In "Functional and Logic Programming"
(eds. DeGroot D. & Lindstrom G.)
Prentice-Hall
1985
REEV81a
Reeve M.
The ALICE Compiler Target Language
Document, Dept of Computing, Imperial College, May 1981
REEV81b
Reeve M.
An Introduction to the ALICE Compiler Target Language
Research Report, Dept of Computing, Imperial College ,July 1981
REEV85a *
Reeve M.
A BNF Description Of The Alice Compiler Target Language
1985
REYN72
Reynolds J.C.
Definitional Interpreters For Higher Order Programming Languages
Proc 25th ACM National Conf, pp 717-740
1972
RICH82
Richmond G.
A Dataflow Implementation of SASL
Msc Thesis, Dept of Comp Sci, Univ. of Manchester, October 1982.
ROBI65a
Robinson J.A.
A Machine Oriented Logic Based on The Resolution Principle
J. Ass. Comput. Mach. 12, pp 23-41
1965
ROBI77
Robinson J.A.
Logic: Form and Function
Edinburgh University Press
1979
ROBI83a *
Robinson J.A.
Logic Programming - Past, Present and Future
( Also in New Generation Computing, Vol 1, No 2, 1983 )
ICOT Research Center, Technical report TR-015
June 1983
ROSE85a
Rosenschein S.J.
Formal Theories of Knowledge in AI and Robotics
New Generation Computing, Vol 3, No 4, pp 345-357
1985
RUSS10,RUSS25a
Russell B. & Whitehead A.N.
Principia Mathematica
Cambridge University Press, 1910 & 1925
RYDE81a *
Rydeheard D.E.
Applications of Category Theory to Programming and Program Specification
Department of Computer Science, University of Edinburgh
Phd Thesis, CST-14-81
December 1981
RYDE85a *
Rydeheard D.E. & Burstall R.M.
The Unification of Terms: A Category-Theoretic Algorithm
Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-8-1
August 1985
SAIN84a *
Saint-James E.
Recursion is More Efficient than Iteration
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming
Austin, Texas
pp 228-234
1984
SAKA83a *
Sakai K. & Miyachi T.
Incorporating Native Negation into PROLOG
( Also in "Proceedings of RIMS Symposia on Software Science and Engineering",
1984, Springer-Verlag )
( Also in "Proceedings of Logic and Conferecne", Monash Univ., 1984 )
ICOT Research center, Technical Report TR-028
October 1983
SAKA84a
Sakai K.
An Ordering for Term Rewriting System
ICOT Research Center, Technical Report TR-062
April 1984
SAKA84b
Sakai H. & Iwata K. & Kamiya S. & Abe K. & Tanaka T. & Shibayama S &
Murukami K.
Design and Implementation of the Relational Database Engine
( Also in "Proceedings of FGCS 84", Tokyo, 1984 )
ICOT Research Center, Technical Report TR-063
April 1984
SAKA85a
Sakai T.
Intelligent Sensor
Preface for New Generation Computing Vol 3 No 4, 1985, pp 339-340
1985
SAME84a
Samet H.
The Quadtree and Related Hierarchial Data Structures
ACM Comp. Surveys Vol16, No 2, June 1984,p187-260
SAR82a
Sargeant J.
Implementation of Structured LUCID on a Data Flow Computer
MSc Thesis, Dept of Comp Sci, Univ. of Manchester, October 1982
SATO83a *
Sato M. & Sakurai T.
Qute: A Prolog/Lisp Type Language for Logic Programming
( Also in "Proceedings of 8th IJCAI", Karlsluhe, 1983 )
ICOT Research center, Technical Report TR-016
August 1983
SATO84a
Sato M. & Sakurai T.
Qute Users Manual
Dept. of Information Science, Faculty of Science, University of Tokyo
SATO84b *
Sato T. & Tamaki H.
Enumeration of Success Patterns In Logic Programs
Theoretical Computer Science, pp 227-240
1984
SCHM78a
Schmitz L.
An Exercise in Program Synthesis: Algorithms For Computing The
Transitive Closure of A Relation
Internal Report, Hochschule der Bundeswehr, Munich
1978
SCHM85a *
Scmittgen C. & Gerdts A. & Haumann & Kluge W. & Woitass
A System-Supported Workload Balancing Scheme for Cooperating Reduction
Machines
GMD Tech Rep
June 1985
SCHM85b *
Schmittgen C.
A Data Type Architecture for Reduction Machines
GMD 152
May 1985
SCHM85c *
Schmidt D.A.
Detecting Global Variables in Denotational Specifications
ACM Transactions on Programming Languages and Systems, Vol 7, no 2
pp 299-310
April 1985
SCHWA76a *
Scwartz J.
Event Based Reasoning - A System For Proving Correct Termination of Prorgams
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 131-146
Edinburgh University Press, 1976
SCHWA77a
Schwartz J.
Using Annotations To Make Recursion Equations Behave
Report No 43, Dept of A.I., Univ of Edinburgh
1977
SCHWE84a
Schweppe H.
Some Comments on Sequential Disk Cache Management for Knowledge Base Systems
ICOT Research Center, Technical Report TR-040
January 1984
SCOT70a
Scott D.S.
Outline of Mathematical Theory of Computation
Oxford University Programming Research Group
Tech Monograph no 2
1970
SCOT71a
Scott D. & Strachey C.
Towards a Mathematical Semantics for Computer Languages
1971 Symposium on Computers and Automata
Microwave Research Institute Proceedings, Vol 21
Polytechnic Institute of Brooklyn
1972
SCOT76
Scott D.S.
Data Types as Lattices
SIAM J.L. Computing 5, pp 522-587
1976
SCOT81
Scott D.
Lectures on a Mathematical Theory of Computation
Tech. Monograph PRG-19
Oxford Univ, Computing Lab, Programming Research Group
1981
SCOT82a
Scott D.
Domains for Denotational Semantics
Automata, Languages and Programming, Proc 10th Int. Colloq.
(ed. Nielsen M. & Schmidt E.M.)
Springer Verlag LNCS no 140, pp 577-613
1982
SCOT82b
Scott D.S.
Lectures on a Mathematical Theory of Computation
in BROY82a, pp 145-292
1982
SEIT85
Seitz C.L.
The Cosmic Cube
CACM Vol 28, no 1, January 1985
SERG82
Sergot M.
A Query-the-User Facility for Logic Programming
Proc. ECICS, Stresa, Italy, (eds. P. Degano & E. Sandwall)
pp 27-41, 1982
North Holland
SHAN85a *
Shanahan M.
The Execution of Logic Programs Considered as the Reduction of Set Expressions
Computer Laboratory, University of Cambridge
October 1985
SHAR85a
Sharp J.A.
Data Flow Computing
Ellis Horwood, March 1985
SHAP83a *
Shapiro E.Y.
A Subset Concurrent Prolog and its Interpreter, 2nd Version
ICOT Research center, technical Report TR-003
January 1983
SHAP83b *
Shapiro E.Y. & Takeuchi A.
Object Oriented Programming in Concurrent Prolog
( Also in New Generation Computing, Springer Verlag, Vol 1, No 1, 1983 )
ICOT Research Center, Technical Report TR-004
April 1983
SHAP83c *
Systems Progamming in Concurrent Prolog
( Also in "Proceedings of the 11th Annual ACM Symposium on Principles of
Programming Languages" )
ICOT Research Center, Technical Report TR-034
November 1983
SHAP84a *
Shapiro E. & Mierowsky C.
Fair, Biased, and Self-Balancing Merge Operators :
Their Specification and Implementation in Concurrent Prolog
CS84-07
Dept of Applied Mathematics, Weizmann Institute of Science, Israel
1984
SHAP84b *
Shapiro E.Y.
Alternation and the Computational Complexity of Logic Programs
CS84-06
Dept of Applied Mathematics, Weizmann Institute of Science, Israel
January 1984
SHAW85a *
Shaw D.E. & Sabety T.M.
The Multiple-Processor PPS Chip of the NON-VON 3 Supercomputer
Integration, the VLSI Journal, 3, pp 161-174
1985
SHEI83a *
Sheil B.
Family of Personal Lisp Machines Speeds AI Program Development
Electronics, November 3, 1983, pp 153-156
1983
SHIB82a
Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murukami K.
A Relational Database Machine "Delta"
ICOT Research Center, Technical Memorandum TM-0002
November 1982
SHIB84a
Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murakami K.
A Relational Database Machine with Large Semiconductor Disk and Hardware
Relational Algebra Processor
( Also in New Generation Computing, Vol 2, No 2, 1984 )
ICOT Research Center, Technical Report TR-053
March 1984
SHIB84b
Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murukami K.
Query Processing Flow on RDBM Delta's Functionally - Distributed Architecture
ICOT Research Center, Technical Report TR-064
April 1984
SHIE85a *
Shields M.W.
Concurrent Machines
Computer Journal, Vol 28, no 5, pp 449-465
1985
SHIM83a
Shimizu H.
GP-PRO Graphic Display Control Library Written in Prolog
ICOT Research Center, Technical Memorandum TM-0025
August 1985
SHIP81a
Shipman D.W.
The functional data model and the data language DAPLEX
ACM TODS 6(1) p140-173 1981
SHOH85a
Shoham Y.
Ten Requirements for a Theory of Change
New Generation Computing, Vol 3, No 4, pp 467-477
1985
SICK82a
Sickel S.
Specification and Derivation of Programs
in BROY82a, pp 103-132
1982
SIVI85a *
Sivilotti M. & Emerling M. & Mead C.
A Novel Associative Memory Implemented Using Collective Computation
1985 Chapel Hill Conference on VLSI, pp 329-342
1985
SLEE80
Sleep M.R.
Applicative Languages, Dataflow and Pure Combinatory Code
Proc IEEE Compcon 80, pp 112-115
February 1980
SLEE82
Sleep M.R. & Holmstrom S.
A Short Concerning Lazy Reduction Rules of Append
Document, Computer Studies Centre, University of East Anglia,May 1982
SLEE83
Sleep M.R.
Novel Architectures
Distributed Computing- A Review for Industry, SERC, Manchester 1983
SLEE84
Sleep M.R. and Kennaway J.R.
The Zero Assignment Parallel Processor (ZAPP) Project
in DUCE84
1984
SLEE86a *
Sleep M.R.
Directions in Parallel Architecture
in BCS86a
1986
SLOM83a *
Sloman A. & Hardy S.
Poplog : A Multi-Purpose Multi-Language Program Development Environment
AISB Quarterly, vol 47, pp 26-34
1983
SMYT78a *
Smyth M.B.
Power Domains
Journal of Computer and System Sciences, Vol 16, pp 23-36
1978
SNYD79
Snyder A.
A Machine Architecture to Support an Object-Oriented Language
MIT Laboratory for Computer Science, MIT/LCS/TR-209, March 1979
SOLE85
Soley M.S.
Generic Software for Emulating Multiprocessor Architectures
Draft of MSc Thesis to be submitted May 1985
SPIV84
Spivey Mike
University of York Portable Prolog System Users Guide
University of York 1984
SRIN86a *
Srini V.P.
An Architectural Comparison of Dataflow Systems
IEEE Computer, March 1986, pp 68-88
1986
STAL85a *
Stallard R.P.
Occam - A Brief Introduction
Occam - The Loughborough Implmentation
Computer Studies Laboratory Report
Dept of Computer Studies, Loughborough University of Technology.
November 1985
STAM85a*
Stammers R.A.
Report to the Alvey Directorate on a Short Survey of The Industrial
Applications of Logic and Functional Programming in the United
Kingdom and United States
27 August 1985
STAP77a *
Staples J.
A Class of Replacement Systems With Simple Optimality Theory
Bull. Aust. Math. Soc., Vol 17, pp335-350
1977
STAP80a
Staples J.
Computation on Graph-Like Expressions
Th. Comp. Sci., Vol 10, pp 171-185
1980
STAP80b
Staples J.
Optimal Evaluations Of Graph-Like Expressions
Th. Comp. Sci., Vol 10, pp 297-316
1980
STAR84a *
Stark W.R.
A Glimpse Into The Paradise of Combinatory Algebra
International Journal of Computer and Information Sciences
Vol 13, No 3, pp 219-236
1984
STEE76
Steele G.L.Jr. & Sussman G.J.
LAMBDA: The Ultimate Imperative
AI Memo no 353
Artificial Intelligence Laboratory, MIT
1976
STEE77a
Steele G.L.Jr.
Compiler Optimization Based on Viewing LAMBDA as Rename Plus Goto
S.M. Thesis, MIT EE&CS, Cambridge.
Published as RABBIT: A Compiler for SCHEME (A Study in Compiler Optimization),
AI TR 474, MIT Lab, Cambridge
STEE77b
Steele G.L.Jr.
Debunking The 'Expensive Procedure Call' Myth
Proc. ACM National Conference, pp 153-162, 1962
Also revised as AI Memo 443, MIT Lab, Cambridge
STEE78
Steele G.L.Jr. & Sussman G.J.
The Art Of The Interpreter; or, The Modularity Complex
(parts zero,one and two)
AI Memo 453, MIT AI Lab, Cambridge, 1978
STEE79a
Steele G.L.Jr. & Sussman G.J.
Design of LISP-Based Processors; or, SCHEME: A Dielectric LISP; or,
Finite Memories Considered Harmful; or, LAMBDA The Ultimate Opcode
AI Memo 514, MIT AI Lab, Cambridge, 1979
Summarized in CACM 23 no 11, pp 629-645
STEE79b
Steele G.L.Jr. & Sussman G.J.
The Dream Of A Lifetime: A Lazy Scoping Mechanism
AI Memo 527, MIT Lab, Cambridge, 1979
STEP86a *
Stephenson B.K.
Computer Architectures for Image Processing
in BCS86a
1986
STIR85a *
Stirling C.
Modal Logics for Communicating Systems
Internal report, CSR-193-85
Department of Computer Science, University of Edinburgh
October 1985
STIR86a *
A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic For
A Concurrent While Language
To appear in ICALP 1986
1986
STOY77a
Stoy J.E.
Denotational Semantics: The Scott-Strachey Approach to Programming Language
Theory
MIT Press, Cambridge Massachusetts
1977
STOY82a
Stoy J.
Some Mathematical Aspects Of Functional Programming
in DARL82a
1982
STOY82b
Stoy J.E.
Semantic Models
in BROY82a, pp 293-324
1982
STOY83a *
Stoye W.
The SKIM Microprogrammer's Guide
Computer Laboratory, University of Cambridge
Technical Report no 40
October 1983
STOYE84a *
Stoye W.
A New Scheme for Writing Functional Operating Systems
Computer Laboratory, University of Cambridge
Technical Report no 56
1984
STOYE84b *
Stoye W.R. & Clarke T.J.W. & Norman A.C.
Some Practical Methods for Rapid Combinator Reduction
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming
Austin, Texas
pp 159-166
1984
SUGI83a
Sugiyama K. & Kameda M. & Akiyama K. & Makinouchi A.
A Knowledge Representation System in Prolog
ICOT Research Center, Technical Report TR-024
August 1983
SUGI84a
Sugimoto M. & Kato H. & Yoshida H.
Design Concept for a Software Development Consultation System
( Also in Second Japanese Swedish Workshop on Logic Programming and
Functional Programming, Uppsala, 1984 )
ICOT Research Center, Technical Report TR-071
August 1984
SUSS75a
Sussman G.J. & Steele G.L.Jr.
SCHEME: An Interpreter for Extended Lambda Calculus
AI Memo 349, MIT AI Lab, Cambridge, 1975
SUSS82a
Sussman G.J.
LISP, Programming and Implementation
in DARL82a
1982
SUZU82a
Suzuki N. & Kurihara K. & Tanaka H. & Moto-oka T.
Procedure Level Data Flow Processing on Dynamic Structure Multimicroprocessors
Journal of Information Processing Vol 5, No. 1 p11-16 March, 1982
SUZU82b
Suzuki N.
Experience with Specification and Verification of Hardware using PROLOG
Document, Presented at Working Conference on VLSI Engineering, Oct 1982
SYRE77a
Syre J.C. et al
Pipelining, Parallelism and Asynchronism in The LAU System
Proc. 1977 Int. Conf. on Parallel Processing, pp 87-92
August 1977
------------------------------
End of AIList Digest
********************
